• Corpus ID: 15031100

Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Multi-agent Formation Path Planning

@article{Yu2012ShortestPS,
  title={Shortest Path Set Induced Vertex Ordering and its Application to Distributed Distance Optimal Multi-agent Formation Path Planning},
  author={Jingjin Yu},
  journal={arXiv: Robotics},
  year={2012}
}
  • Jingjin Yu
  • Published 1 May 2012
  • Computer Science
  • arXiv: Robotics
For the task of moving a group of indistinguishable agents on a connected graph with unit edge lengths into an arbitrary goal formation, it was previously shown that distance optimal paths can be scheduled to complete with a tight convergence time guarantee, using a fully centralized algorithm. In this study, we show that the problem formulation in fact induces a more fundamental ordering of the vertices on the underlying graph network, which directly leads to a more intuitive scheduling… 
1 Citations

Figures and Tables from this paper

References

SHOWING 1-10 OF 26 REFERENCES

Distance optimal formation control on graphs with a tight convergence time guarantee

  • Jingjin YuS. LaValle
  • Computer Science
    2012 IEEE 51st IEEE Conference on Decision and Control (CDC)
  • 2012
This work proposes a fast distance optimal control algorithm that guides the agents into the desired formation and shows that the algorithm also provides a tight convergence time guarantee.

Automatic Generation of Persistent Formations for Multi-agent Networks Under Range Constraints

A collection of graph-based methods for determining if a team of mobile robots, subjected to sensor and communication range constraints, can persistently achieve a specified formation, as well as an algorithm that automatically generates a sequence of such operations.

Centralized path planning for multiple robots: Optimal decoupling into sequential plans

This work develops an algorithm to decouple a multi-robot path planning problem into subproblems whose solutions can be executed sequentially, and can decouple and solve path planning problems with many robots, even with incomplete external planners.

Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths

An approach to generate continuous velocity profiles for multiple robots; these velocity profiles satisfy the dynamics constraints, avoid collisions, and minimize the completion time is presented.

Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths

An approach to generate continuous velocity profiles for multiple robots; these velocity profiles satisfy the dynamics constraints, avoid collisions, and minimize the completion time is presented.

A distributed and optimal motion planning approach for multiple mobile robots

  • Yi GuoL. Parker
  • Computer Science
    Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292)
  • 2002
This work proposes a distributed and optimal motion planning algorithm for multiple robots that explicitly optimizes performance functions through a distributed implementation and is one of the few that is capable of handling outdoor rough terrain environments and real time replanning.

Graph-theoretic connectivity control of mobile robot networks

A graph-theoretic definition of connectivity is provided, as well as an equivalent definition based on algebraic graph theory, which employs the adjacency and Laplacian matrices of the graph and their spectral properties.

Coordination of groups of mobile autonomous agents using nearest neighbor rules

Simulation results are provided which demonstrate that the nearest neighbor rule they are studying can cause all agents to eventually move in the same direction despite the absence of centralized coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves.

Information flow and cooperative control of vehicle formations

A Nyquist criterion is proved that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability, and a method for decentralized information exchange between vehicles is proposed.

Toward Efficient Trajectory Planning: The Path-Velocity Decomposition

The decomposition of TPP is summarized by the equation TPP => PPP + VPP, and VPP is transformed to a two-dimensional PPP in path-time space with some additional constraints.