Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/152099
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, Yuan | en_US |
dc.contributor.author | Hu, Hesuan | en_US |
dc.contributor.author | Liu, Yang | en_US |
dc.contributor.author | Lin, Shang-Wei | en_US |
dc.contributor.author | Ding, Zuohua | en_US |
dc.date.accessioned | 2021-09-09T05:13:26Z | - |
dc.date.available | 2021-09-09T05:13:26Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | Zhou, Y., Hu, H., Liu, Y., Lin, S. & Ding, Z. (2019). A distributed method to avoid higher-order deadlocks in multi-robot systems. Automatica, 112, 108706-. https://dx.doi.org/10.1016/j.automatica.2019.108706 | en_US |
dc.identifier.issn | 0005-1098 | en_US |
dc.identifier.uri | https://hdl.handle.net/10356/152099 | - |
dc.description.abstract | Deadlock avoidance is a crucial problem in motion control of multi-robot systems since deadlocks can crash the systems and ∕or degrade their performance. However, deadlocks sometimes are difficult to predict in advance because of the existence of higher-order deadlocks, from which a system can lead to a deadlock inevitably. In this paper, we investigate the properties of higher-order deadlocks and propose a distributed approach to their avoidance in multi-robot systems where each robot has a predetermined and closed path to execute persistent motion. After modeling the motion of robots by labeled transition systems (LTSs), we first conclude that there exist at most the (N−3)-th order deadlocks with N robots. This means that deadlocks, if any, will occur unavoidably within N−3 steps of corresponding transitions. A distributed algorithm is then proposed to avoid deadlocks in such systems. In the algorithm, each robot only needs to look ahead at most N−1 states, i.e., N−3 intermediate states and two endpoint states, to decide whether its move can cause higher-order deadlocks. To execute the algorithm, each robot needs to communicate with its neighbors. The theoretical analysis and experimental study show that the proposed algorithm is practically operative. | en_US |
dc.description.sponsorship | Ministry of Education (MOE) | en_US |
dc.language.iso | en | en_US |
dc.relation | MOE2015-T2-2-049 | en_US |
dc.relation.ispartof | Automatica | en_US |
dc.rights | © 2019 Elsevier Ltd. All rights reserved. | en_US |
dc.subject | Engineering::Computer science and engineering | en_US |
dc.title | A distributed method to avoid higher-order deadlocks in multi-robot systems | en_US |
dc.type | Journal Article | en |
dc.contributor.school | School of Computer Science and Engineering | en_US |
dc.identifier.doi | 10.1016/j.automatica.2019.108706 | - |
dc.identifier.scopus | 2-s2.0-85075577981 | - |
dc.identifier.volume | 112 | en_US |
dc.identifier.spage | 108706 | en_US |
dc.subject.keywords | Autonomous Mobile Robots | en_US |
dc.subject.keywords | Deadlock | en_US |
dc.description.acknowledgement | This work was supported by the Natural Science Foundation of China under Grant Nos. 61573265, 61203037, 51305321, 61751210, 61572441, and 61973242, Fundamental ResearchFunds for the Central Universities under Grant Nos. K7215581201, K5051304004, and K5051304021, New Century Excellent Talents in University under Grant No. NCET-12-0921, and Academic Research Fund Tier 2 by Ministry of Education in Singapore under Grant No. MOE2015-T2-2-049. | en_US |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
Appears in Collections: | SCSE Journal Articles |
SCOPUSTM
Citations
20
9
Updated on Jul 5, 2022
PublonsTM
Citations
20
10
Updated on Jul 6, 2022
Page view(s)
151
Updated on Aug 7, 2022
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.