pith. sign in

arxiv: 1909.02502 · v1 · pith:QWJTUVXEnew · submitted 2019-09-05 · 💻 cs.RO

Continuous-Time Trajectory Optimization for Decentralized Multi-Robot Navigation

classification 💻 cs.RO
keywords trajectorymulti-robotcollision-freenavigationoptimizationrobotsalgorithmcontinuous-time
0
0 comments X
read the original abstract

Multi-robot systems have begun to permeate into a variety of different fields, but collision-free navigation in a decentralized manner is still an arduous task. Typically, the navigation of high speed multi-robot systems demands replanning of trajectories to avoid collisions with one another. This paper presents an online replanning algorithm for trajectory optimization in labeled multi-robot scenarios. With reliable communication of states among robots, each robot predicts a smooth continuous-time trajectory for every other remaining robots. Based on the knowledge of these predicted trajectories, each robot then plans a collision-free trajectory for itself. The collision-free trajectory optimization problem is cast as a non linear program (NLP) by exploiting polynomial based trajectory generation. The algorithm was tested in simulations on Gazebo with aerial robots.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.