Kinodynamic motion planning is an important problem in robotics. It consists of planning the dynamic motion of a robotic system taking into account its kinematic and dynamic constraints. For this class of problems, high dimensionality is a major difficulty and finding an exact time optimal robot motion trajectory is proven to be NP-hard. Probabilistic approximate techniques have therefore been proposed in the literature to solve particular problem instances. These methods include Randomized Potential Field Planners (RPP), Probabilistic Roadmaps (PRM) and Rapidly Exploring Random Trees (RRT). When physical obstacles and differential constraints are added to the problem, applying RPPs or PRMs encounter difficulties. In order to handle these difficulties, RRTs have been proposed. In this study, we consider a multiple camera industrial inspection problem where the concurrent motion of these cameras needs to be planned. The cameras are required to capture maximum number of defect locations while globally avoiding collisions with each other and with obstacles. Our approach is to consider a solution to the kinodynamic planning problem of multiple camera inspection by making use of the RRT algorithm. We explore and resolve issues arising when RRTs are applied to this specific problem class. Along these lines, we consider the cases of a single camera without obstacles and then with obstacles. Then, we attempt to extend the study to the case of multiple camera where we also need to avoid collisions between cameras. We present simulation results to show the performance of our RRT based approach to different instrument configurations and compare with existing deterministic approaches.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12610543/index.pdf |
| Date | 01 June 2009 |
| Creators | Bilge, Burak |
| Contributors | Saranli, Afsar |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0025 seconds