A quasi-centralized collision-free path planning approach for multi robot systems

Show simple item record

dc.contributor.author G., Rohith
dc.contributor.author Vadali, Madhu
dc.date.accessioned 2021-03-26T14:51:10Z
dc.date.available 2021-03-26T14:51:10Z
dc.date.issued 2021-03
dc.identifier.citation G., Rohith and Vadali, Madhu, "A quasi-centralized collision-free path planning approach for multi robot systems", arXiv, Cornell University Library, DOI: arXiv:/2103.10316, Mar. 2021. en_US
dc.identifier.uri http://arxiv.org/abs/2103.10316
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/6392
dc.description.abstract This paper presents a novel quasi-centralized approach for collision-free path planning of multi-robot systems (MRS) in obstacle-ridden environments. A new formation potential fields (FPF) concept is proposed around a virtual agent, located at the center of the formation which ensures self-organization and maintenance of the formation. The path of the virtual agent is centrally planned and the robots at the minima of the FPF are forced to move along with the virtual agent. In the neighborhood of obstacles, individual robots selfishly avoid collisions, thus marginally deviating from the formation. The proposed quasi-centralized approach introduces formation flexibility into the MRS, which enables MRS to effectively navigate in an obstacle-ridden workspace. Methodical analysis of the proposed approach and guidelines for selecting the FPF are presented. Results using a candidate FPF are shown that ensure a pentagonal formation effectively squeezes through a narrow passage avoiding any collisions with the walls.
dc.description.statementofresponsibility by Rohith G. and Madhu Vadali
dc.language.iso en_US en_US
dc.publisher Cornell University Library en_US
dc.title A quasi-centralized collision-free path planning approach for multi robot systems en_US
dc.type Pre-Print en_US
dc.relation.journal arXiv


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account