An evolutionary approach to capacitated resource distribution by a multiple-agent team

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

Abstract

A hybrid implementation of an evolutionary metahueristic scheme with local optimization has been applied to a constrained problem of routing and scheduling a team of robotic agents to perform a resource distribution task in a possibly dynamic environment. In this paper a central planner is responsible for planning routes and schedules for the entire team of cooperating robots. The potential computational complexity of such a centralized solution is addressed by an innovative genetic, approach that transforms the task of multiple route design into a special manifestation of the traveling salesperson problem. The key advantage of this approach is that globally optimal or near optimal solutions can be produced in a timeframe amenable for real-time implementation. The algorithm was tested on a set of standard problems with encouraging results. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Hussain, M., Kimiaghalam, B., Homaifar, A., Esterline, A., & Sayyarodsari, B. (2003). An evolutionary approach to capacitated resource distribution by a multiple-agent team. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2723, 657–668. https://doi.org/10.1007/3-540-45105-6_81

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