Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Défago, Xavier"'
Autor:
Okumura, Keisuke, Défago, Xavier
We propose a novel algorithm to solve multi-robot motion planning (MRMP) rapidly, called Simultaneous Sampling-and-Search Planning (SSSP). Conventional MRMP studies mostly take the form of two-phase planning that constructs roadmaps and then finds in
Externí odkaz:
http://arxiv.org/abs/2203.00315
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution
Autor:
Okumura, Keisuke, Défago, Xavier
Real-time planning for a combined problem of target assignment and path planning for multiple agents, also known as the unlabeled version of Multi-Agent Path Finding (MAPF), is crucial for high-level coordination in multi-agent systems, e.g., pattern
Externí odkaz:
http://arxiv.org/abs/2109.04264
Autor:
Hirata, Mai, Tsukada, Manabu, Okumura, Keisuke, Tamura, Yasumasa, Ochiai, Hideya, Défago, Xavier
Cooperative intelligent transportation systems (ITS) are used by autonomous vehicles to communicate with surrounding autonomous vehicles and roadside units (RSU). Current C-ITS applications focus primarily on real-time information sharing, such as co
Externí odkaz:
http://arxiv.org/abs/2108.04629
Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
Publikováno v:
In Nonlinear Analysis: Hybrid Systems May 2024 52
This paper studies a novel planning problem for multiple agents that cannot share holding resources, named OTIMAPP (Offline Time-Independent Multi-Agent Path Planning). Given a graph and a set of start-goal pairs, the problem consists in assigning a
Externí odkaz:
http://arxiv.org/abs/2105.07132
This paper presents a novel robot-environment interaction in navigation tasks such that robots have neither a representation of their working space nor planning function, instead, an active environment takes charge of these aspects. This is realized
Externí odkaz:
http://arxiv.org/abs/2102.12748
We study the iterative refinement of path planning for multiple robots, known as multi-agent pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution of MAPF is a set of paths without collisions. Iterative refi
Externí odkaz:
http://arxiv.org/abs/2102.12331
This paper addresses novel consensus problems for multi-agent systems operating in an unreliable environment where adversaries are spreading. The dynamics of the adversarial spreading processes follows the susceptible-infected-recovered (SIR) model,
Externí odkaz:
http://arxiv.org/abs/2012.13757
This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network model, ass
Externí odkaz:
http://arxiv.org/abs/2008.04252
This paper addresses novel consensus problems in the presence of adversaries that can move within the network and induce faulty behaviors in the attacked agents. By adopting several mobile adversary models from the computer science literature, we dev
Externí odkaz:
http://arxiv.org/abs/2006.11711