File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Optimal planning of a mobile sensor for aircraft rivet inspection

TitleOptimal planning of a mobile sensor for aircraft rivet inspection
Authors
KeywordsCrack detection
Mobile sensor
Traveling salesman problem
Issue Date2005
Citation
Proceedings - IEEE International Conference on Robotics and Automation, 2005, v. 2005, p. 3181-3186 How to Cite?
AbstractThis paper addresses the path planning problem of a mobile sensor, which is a micro Crawler robot equipped with a Eddy Current probe, for aircraft rivet inspection. Due to the specific movement characteristic of the Crawler robot, the path, or the rivet sequence should enable the Crawler robot to realize the localization-and-reposition process. Therefore a final path is subject to the following three requirements: i) the distance between any two consecutive rivets on the path should be less than a threshold distance; ii) the number of turns should be minimized and iii) the overall distance should be minimized. In this paper, a novel algorithm is developed to generate the required path. This algorithm first identifies the minimum set of line segments partitioning all the rivets and then connects the line segments to minimize the overall distance. Simulation results are provided to validate the proposed algorithm. © 2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/212898
ISSN

 

DC FieldValueLanguage
dc.contributor.authorSheng, Weihua-
dc.contributor.authorChen, Hongjun-
dc.contributor.authorChen, Heping-
dc.contributor.authorXi, Ning-
dc.date.accessioned2015-07-28T04:05:22Z-
dc.date.available2015-07-28T04:05:22Z-
dc.date.issued2005-
dc.identifier.citationProceedings - IEEE International Conference on Robotics and Automation, 2005, v. 2005, p. 3181-3186-
dc.identifier.issn1050-4729-
dc.identifier.urihttp://hdl.handle.net/10722/212898-
dc.description.abstractThis paper addresses the path planning problem of a mobile sensor, which is a micro Crawler robot equipped with a Eddy Current probe, for aircraft rivet inspection. Due to the specific movement characteristic of the Crawler robot, the path, or the rivet sequence should enable the Crawler robot to realize the localization-and-reposition process. Therefore a final path is subject to the following three requirements: i) the distance between any two consecutive rivets on the path should be less than a threshold distance; ii) the number of turns should be minimized and iii) the overall distance should be minimized. In this paper, a novel algorithm is developed to generate the required path. This algorithm first identifies the minimum set of line segments partitioning all the rivets and then connects the line segments to minimize the overall distance. Simulation results are provided to validate the proposed algorithm. © 2005 IEEE.-
dc.languageeng-
dc.relation.ispartofProceedings - IEEE International Conference on Robotics and Automation-
dc.subjectCrack detection-
dc.subjectMobile sensor-
dc.subjectTraveling salesman problem-
dc.titleOptimal planning of a mobile sensor for aircraft rivet inspection-
dc.typeConference_Paper-
dc.description.natureLink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ROBOT.2005.1570600-
dc.identifier.scopuseid_2-s2.0-33846151699-
dc.identifier.volume2005-
dc.identifier.spage3181-
dc.identifier.epage3186-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats