File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ROBOT.2005.1570600
- Scopus: eid_2-s2.0-33846151699
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Optimal planning of a mobile sensor for aircraft rivet inspection
Title | Optimal planning of a mobile sensor for aircraft rivet inspection |
---|---|
Authors | |
Keywords | Crack detection Mobile sensor Traveling salesman problem |
Issue Date | 2005 |
Citation | Proceedings - IEEE International Conference on Robotics and Automation, 2005, v. 2005, p. 3181-3186 How to Cite? |
Abstract | This 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 Identifier | http://hdl.handle.net/10722/212898 |
ISSN | 2020 SCImago Journal Rankings: 0.915 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sheng, Weihua | - |
dc.contributor.author | Chen, Hongjun | - |
dc.contributor.author | Chen, Heping | - |
dc.contributor.author | Xi, Ning | - |
dc.date.accessioned | 2015-07-28T04:05:22Z | - |
dc.date.available | 2015-07-28T04:05:22Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Proceedings - IEEE International Conference on Robotics and Automation, 2005, v. 2005, p. 3181-3186 | - |
dc.identifier.issn | 1050-4729 | - |
dc.identifier.uri | http://hdl.handle.net/10722/212898 | - |
dc.description.abstract | This 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.language | eng | - |
dc.relation.ispartof | Proceedings - IEEE International Conference on Robotics and Automation | - |
dc.subject | Crack detection | - |
dc.subject | Mobile sensor | - |
dc.subject | Traveling salesman problem | - |
dc.title | Optimal planning of a mobile sensor for aircraft rivet inspection | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ROBOT.2005.1570600 | - |
dc.identifier.scopus | eid_2-s2.0-33846151699 | - |
dc.identifier.volume | 2005 | - |
dc.identifier.spage | 3181 | - |
dc.identifier.epage | 3186 | - |
dc.identifier.issnl | 1050-4729 | - |