Decentralized trajectory optimization using virtual motion camouflage and particle swarm optimization

6Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper investigates a decentralized trajectory optimization method to solve a nonlinear constrained trajectory optimization problem. Especially, we consider a problem constrained on the terminal time and angle in a multi-robot application. The proposed algorithm is based on virtual motion camouflage (VMC) and particle swarm optimization (PSO). VMC changes a typical full space optimal problem to a subspace optimal problem, so it can reduce the dimension of the original problem by using path control parameters (PCPs). If PCPs are optimized, then the optimal path can be obtained. In this work, PSO is used to optimize these PCPs. In multi-robot path planning, each robot generates its own optimal path by using VMC and PSO, and sends its path information to the other robots. Then, the other robots use this path information when planning their own paths. Simulation and experimental results show that the optimal paths considering the terminal time and angle constraints are effectively generated by decentralized VMC and PSO.

Cite

CITATION STYLE

APA

Kwak, D. J., Choi, B., Cho, D., Kim, H. J., & Lee, C. woo. (2015). Decentralized trajectory optimization using virtual motion camouflage and particle swarm optimization. Autonomous Robots, 38(2), 161–177. https://doi.org/10.1007/s10514-014-9399-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free