Distributed Online Convex Programming for Collision Avoidance in Multi-agent Autonomous Vehicle Systems

2019 ◽  
Author(s):  
Guohui Ding ◽  
Hadi Ravanbakhsh ◽  
Zhiyuan Liu ◽  
Sriram Sankaranarayanan ◽  
Lijun Chen
Keyword(s):  
Convex Programming ◽  
Collision Avoidance ◽  
Autonomous Vehicle ◽  
Vehicle Systems ◽  
Multi Agent

Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks

2020 ◽  
Author(s):  
Johan Arcile ◽  
Raymond Devillers ◽  
Hanna Klaudel
Keyword(s):  
State Space ◽  
Petri Net ◽  
Timed Automata ◽  
Autonomous Vehicle ◽  
Computation Time ◽  
The State ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Vehicle Systems ◽  
Multi Agent

We formalise and study multi-agent timed models MAPTs (Multi-Agent with Periodic timed Tasks), where each agent is associated with a regular timed schema upon which all possible actions of the agent rely. MAPTs allow for an accelerated semantics and a layered structure of the state space, so that it is possible to explore the latter dynamically and use heuristics to greatly reduce the computation time needed to address reachability problems. We use an available tool for the Petri net implementation of MAPTs, to explore the state space of autonomous vehicle systems. Then, we compare this exploration with timed automata-based approaches in terms of expressiveness of available queries and computation time.

Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks

2020 ◽  
Vol 175 (1-4) ◽  
pp. 59-95
Author(s):  
Johan Arcile ◽  
Raymond Devillers ◽  
Hanna Klaudel
Keyword(s):  
State Space ◽  
Petri Net ◽  
Timed Automata ◽  
Autonomous Vehicle ◽  
Computation Time ◽  
The State ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Vehicle Systems ◽  
Multi Agent

We formalise and study multi-agent timed models MAPTs (Multi-Agent with Periodic timed Tasks), where each agent is associated with a regular timed schema upon which all possible actions of the agent rely. MAPTs allow for an accelerated semantics and a layered structure of the state space, so that it is possible to explore the latter dynamically and use heuristics to greatly reduce the computation time needed to address reachability problems. We use an available tool for the Petri net implementation of MAPTs, to explore the state space of autonomous vehicle systems. Then, we compare this exploration with timed automata-based approaches in terms of expressiveness of available queries and computation time.

Collision Avoidance Algorithms: Multi-agent Approach

2007 ◽  
pp. 348-360 ◽  
Author(s):  
Pavel Vrba ◽  
Vladimír Mařík ◽  
Libor Přeučil ◽  
Miroslav Kulich ◽  
David Šišlák
Keyword(s):  
Collision Avoidance ◽  
Multi Agent
Sign in / Sign up

Export Citation Format

Share Document