Verification of agent navigation in partially-known environments
DOI10.1016/J.ARTINT.2022.103724zbMATH Open1495.68234OpenAlexW4226339517MaRDI QIDQ2144175FDOQ2144175
Authors: Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger 
Publication date: 1 June 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103724
Recommendations
model checkingparameterised verificationautomata theoryreasoning about actionsmobile agentslogic in artificial intelligence
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42) Temporal logic (03B44)
Cites Work
- GOLOG: A logic programming language for dynamic domains
- Parameterised verification for multi-agent systems
- Parameterized Model Checking of Token-Passing Systems
- Alternating-time temporal logic
- Reasoning about systems with many processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph structure and monadic second-order logic. A language-theoretic approach
- How to meet asynchronously (almost) everywhere
- Title not available (Why is that?)
- Bounded situation calculus action theories
- Title not available (Why is that?)
- A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
- Reasoning about infinite computations
- Reasoning about strategies: on the model-checking problem
- Cosmological lower bound on the circuit complexity of a small problem in logic
- On Reasoning About Rings
- Near-optimal continuous patrolling with teams of mobile information gathering agents
- A new representation and associated algorithms for generalized planning
- Impossibility of gathering, a certification
- Proving properties of a ring of finite-state machines
- Computational principles of mobile robotics
- Mobile agents in distributed computing: network exploration
- Title not available (Why is that?)
- Liveness of parameterized timed networks
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Anonymous graph exploration with binoculars
- Parameterized model checking of rendezvous systems
- Model checking parameterised multi-token systems via the composition method
- Towards efficient parameterized synthesis
- Parameterized model checking of synchronous distributed algorithms by abstraction
- Formal verification of mobile robot protocols
- Nested Pebbles and Transitive Closure
Cited In (4)
Uses Software
This page was built for publication: Verification of agent navigation in partially-known environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144175)
