File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Motion planning in robotized sensor networks for aircraft rivet inspection

TitleMotion planning in robotized sensor networks for aircraft rivet inspection
Authors
KeywordsStructure Inspection
Robotized Sensor Network
Traveling Salesman Problem
Issue Date2005
Citation
IEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM, 2005, v. 1, p. 638-643 How to Cite?
AbstractThis paper proposes a new robotized mobile sensor network platform to conduct aircraft rivet inspection and addresses the motion planning problem involved. Due to the specific movement characteristics of the mobile robot, the path, or the rivet sequence, should enable each mobile robot to realize the localization-and-reposition process. In this paper, we propose a new algorithm to extend our previous single robot path planning algorithm into the multiple robots version. This algorithm first decomposes the overall rivet set into multiple disjoint subsets based on a graph partitioning algorithm. Then for each subset, we apply our Find-Crawler-TSP algorithm to generate the path. Simulation results validate the proposed algorithm. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/212838

 

DC FieldValueLanguage
dc.contributor.authorSheng, Weihua-
dc.contributor.authorShen, Yantao-
dc.contributor.authorXi, Ning-
dc.date.accessioned2015-07-28T04:05:10Z-
dc.date.available2015-07-28T04:05:10Z-
dc.date.issued2005-
dc.identifier.citationIEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM, 2005, v. 1, p. 638-643-
dc.identifier.urihttp://hdl.handle.net/10722/212838-
dc.description.abstractThis paper proposes a new robotized mobile sensor network platform to conduct aircraft rivet inspection and addresses the motion planning problem involved. Due to the specific movement characteristics of the mobile robot, the path, or the rivet sequence, should enable each mobile robot to realize the localization-and-reposition process. In this paper, we propose a new algorithm to extend our previous single robot path planning algorithm into the multiple robots version. This algorithm first decomposes the overall rivet set into multiple disjoint subsets based on a graph partitioning algorithm. Then for each subset, we apply our Find-Crawler-TSP algorithm to generate the path. Simulation results validate the proposed algorithm. © 2005 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE/ASME International Conference on Advanced Intelligent Mechatronics, AIM-
dc.subjectStructure Inspection-
dc.subjectRobotized Sensor Network-
dc.subjectTraveling Salesman Problem-
dc.titleMotion planning in robotized sensor networks for aircraft rivet inspection-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-27644563553-
dc.identifier.volume1-
dc.identifier.spage638-
dc.identifier.epage643-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats