Extended conflict-based search with awareness

Thomas, S and Deodhare, D and Narasimha Murty, M (2019) Extended conflict-based search with awareness. [Book Chapter]

PDF stu_com_int_771_459-467_2019.pdf - Published Version Restricted to Registered users only Download (326kB) | Request a copy

Abstract

Extended Conflict-Based Search (XCBS) is a distributed agent-based approach which has been used for path finding and scheduling of spatially extended agents on a traversable network. The algorithm arrives at an optimal schedule while resolving conflicts between pairs of agents one at a time. In this chapter, we propose XCBS with Awareness wherein a conflicting agent plan is resolved with respect to the proposed route plan of other agents. The approach allows multiple conflicts to be resolved simultaneously, avoids cascading conflicts in the new plans and shows an improved efficiency in terms of nodes explored and time taken to arrive at the solution.

Item Type:	Book Chapter
Publication:	Studies in Computational Intelligence
Publisher:	Springer Verlag
Additional Information:	The copyright for this article belongs to Springer Verlag.
Keywords:	Conflict resolution; Multi-agent; Path planning; Planning and scheduling; Search algorithm
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	02 Dec 2022 06:33
Last Modified:	02 Dec 2022 06:33
URI:	https://eprints.iisc.ac.in/id/eprint/78044

Actions (login required)

View Item