DISTRIBUTED GRADIENT FOR MULTI-ROBOT MOTION PLANNING

Gerasimos Rigatos

2005

Abstract

Distributed stochastic search is proposed for cooperative behavior in multi-robot systems. Distributed gradient is examined. This method consists of multiple stochastic search algorithms that start from different points in the solutions space and interact to each other while moving towards the goal position. Distributed gradient is shown to be efficient when the motion of the robots towards the goal position is described by a quadratic cost function. The algorithm’s performance is evaluated through simulation tests.

Paper Citation

in Harvard Style

Rigatos G. (2005). DISTRIBUTED GRADIENT FOR MULTI-ROBOT MOTION PLANNING . In Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO, ISBN 972-8865-30-9, pages 59-65. DOI: 10.5220/0001154000590065

in Bibtex Style

@conference{icinco05,
author={Gerasimos Rigatos},
title={DISTRIBUTED GRADIENT FOR MULTI-ROBOT MOTION PLANNING},
booktitle={Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,},
year={2005},
pages={59-65},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001154000590065},
isbn={972-8865-30-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,
TI - DISTRIBUTED GRADIENT FOR MULTI-ROBOT MOTION PLANNING
SN - 972-8865-30-9
AU - Rigatos G.
PY - 2005
SP - 59
EP - 65
DO - 10.5220/0001154000590065