Verification of agent navigation in partially-known environments
DOI10.1016/j.artint.2022.103724zbMath1495.68234OpenAlexW4226339517MaRDI QIDQ2144175
Aniello Murano, Florian Zuleger, Benjamin Aminof, Sasha Rubin
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
automata theorymodel checkingreasoning about actionsmobile agentsparameterised verificationlogic in artificial intelligence
Formal languages and automata (68Q45) Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Agent technology and artificial intelligence (68T42)
Uses Software
Cites Work
- Parameterised verification for multi-agent systems
- Bounded situation calculus action theories
- Near-optimal continuous patrolling with teams of mobile information gathering agents
- Impossibility of gathering, a certification
- A new representation and associated algorithms for generalized planning
- Proving properties of a ring of finite-state machines
- Reasoning about infinite computations
- Parameterized model checking of rendezvous systems
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Anonymous graph exploration with binoculars
- Formal verification of mobile robot protocols
- Model Checking Parameterised Multi-token Systems via the Composition Method
- Towards Efficient Parameterized Synthesis
- Parameterized Model Checking of Token-Passing Systems
- Reasoning About Strategies
- How to meet asynchronously (almost) everywhere
- Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction
- Liveness of Parameterized Timed Networks
- Alternating-time temporal logic
- Cosmological lower bound on the circuit complexity of a small problem in logic
- Reasoning about systems with many processes
- GOLOG: A logic programming language for dynamic domains
- A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
- Nested Pebbles and Transitive Closure
- On Reasoning About Rings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Verification of agent navigation in partially-known environments
