Efficient heuristics for collision avoidance in three dimensions
| dc.contributor.advisor | Sen, Suvrajeet | en_US |
| dc.contributor.author | Rushall, David Aaron, 1964- | |
| dc.creator | Rushall, David Aaron, 1964- | en_US |
| dc.date.accessioned | 2013-03-28T10:26:30Z | |
| dc.date.available | 2013-03-28T10:26:30Z | |
| dc.date.issued | 1989 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/277041 | |
| dc.description.abstract | This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because conventional methods are complex and require vast amounts of computation, heuristic algorithms are more appealing. The focus of this thesis is the problem of moving a point through three dimensional space while avoiding known polyhedral obstacles. A heuristic algorithm to find shortest (near-optimal) collision-free paths in the presence of polyhedral obstacles, given initial and final positions, is presented. Previous methods for the problem rely on an a priori discretization of the space. The points in the discretization form nodes of a graph, and the collision avoidance problem is then solved by using some shortest path algorithm on the graph. The heuristic suggested here successively adds nodes to a graph, thus keeping the size of the graph manageable. The computational results are extremely encouraging. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Heuristic programming. | en_US |
| dc.subject | Algorithms. | en_US |
| dc.subject | Artificial intelligence. | en_US |
| dc.subject | Robotics. | en_US |
| dc.title | Efficient heuristics for collision avoidance in three dimensions | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 24417426 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1337436 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Systems and Industrial Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b17867228 | en_US |
| dc.identifier.bibrecord | .b17867216 | en_US |
| refterms.dateFOA | 2018-09-04T03:41:14Z | |
| html.description.abstract | This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because conventional methods are complex and require vast amounts of computation, heuristic algorithms are more appealing. The focus of this thesis is the problem of moving a point through three dimensional space while avoiding known polyhedral obstacles. A heuristic algorithm to find shortest (near-optimal) collision-free paths in the presence of polyhedral obstacles, given initial and final positions, is presented. Previous methods for the problem rely on an a priori discretization of the space. The points in the discretization form nodes of a graph, and the collision avoidance problem is then solved by using some shortest path algorithm on the graph. The heuristic suggested here successively adds nodes to a graph, thus keeping the size of the graph manageable. The computational results are extremely encouraging. |
