<?xml version="1.0" encoding="UTF-8"?>
<records>
<record>
<language>eng</language>
<publisher>Science and Education Publishing</publisher>
<journalTitle>Journal of Mathematical Sciences and Applications</journalTitle>
<eissn>2333-8792</eissn>
<publicationDate>2016-11-02</publicationDate>
<volume>4</volume>
<issue>1</issue>
<startPage>34</startPage>
<endPage>38</endPage>
<doi>10.12691/jmsa-4-1-6</doi>
<publisherRecordId>JMSA2016416</publisherRecordId>
<documentType>article</documentType>
<title language="eng">Genetic Algorithm for Task Allocation and Path Planning of Multi-robot System</title>
<authors>
<author>
<name>Zhenping Li</name>
<email>lizhenping66@163.com</email>
<affiliationId>1</affiliationId>
</author>
<author>
<name>Xueting Li</name>
<affiliationId>1</affiliationId>
</author>

</authors>
<affiliationsList>
<affiliationName affiliationId="1">School of Information, Beijing Wuzi University, Beijing, China</affiliationName>

</affiliationsList>
<abstract language="eng">Based on the consideration of the collision, the task allocation and path planning of multi-robot system are studied. With robots' the longest travel time as a restrictive condition and the total cost minimum as the objective function, the integer programming model is established; In order to avoid robots colliding in the process of walking, a collision penalty term is introduced and a genetic algorithm with collision detection is designed. Using the genetic algorithm, the optimal solution of task allocation and path planning can be found effectively, the paths can avoid the robots collision. Finally, the model and algorithm are verified by a specific example.</abstract>
<fullTextUrl format="pdf">http://pubs.sciepub.com/jmsa/4/1/6/jmsa-4-1-6.pdf</fullTextUrl>
<keywords language="eng"><keyword>multi-robot system</keyword>
<keyword>collision detection</keyword>
<keyword>integer programming model</keyword>
<keyword>genetic algorithm</keyword>
</keywords>
</record>
</records>
