Files in this item
Files  Description  Format 

application/pdf 3314745.pdf (2MB)  (no description provided) 
Description
Title:  Geodesic Problems for Mobile Robots 
Author(s):  Chitsaz, Hamid Reza 
Doctoral Committee Chair(s):  LaValle, Steven M. 
Department / Program:  Computer Science 
Discipline:  Computer Science 
Degree Granting Institution:  University of Illinois at UrbanaChampaign 
Degree:  Ph.D. 
Genre:  Dissertation 
Subject(s):  Engineering, Robotics 
Abstract:  We consider the differential drive because it is ubiquitous in mobile robotics. To obtain a welldefined notion of shortest, the total amount of wheel rotation is optimized. We analytically characterize minimum wheelrotation trajectories in the absence of obstacles, and identify 52 different minimum wheelrotation trajectories. In the presence of obstacles, every minimum wheelrotation trajectory is composed of two kinds of subtrajectories: on the boundary of obstacles and in the interior of collisionfree space. We prove those subtrajectories that lie in the interior of collisionfree space are tangent to the obstacles at both ends. The bitangency condition yields a nonholonomic bitangency graph which is a network of collisionfree trajectories in which the solution is sought. In general, our nonholonomic bitangency graph is a 2dimensional subset of the 3dimensional configuration space of the robot. Therefore, further optimization or a continuous search may be required to answer queries. However if obstacles are circular and far enough from one another, the graph is a 1dimensional subset of the configuration space and any graph search algorithm, such as Dijkstra's algorithm, extracts the solution. In the second problem, we introduce a new kinematic airplane model. Our airplane is a natural extention of the Dubins car, and extends it with an additional configuration variable for the altitude. We use the Pontryagin Maximum Principle to analytically characterize geodesics for it. To obtain a notion of shortest, time is optimized. Finally, we present an algorithm for computing optimal coordination of two polygonal robots without differential constraints. Each robot has a reference point that must lie on a network of paths called a roadmap. Each robot wants to move from its given initial location to its goal location without colliding with the other one. Rather than impose an a priori cost scalarization for choosing the best combined motion, we consider finding motions whose cost vectors are Paretooptimal. Paretooptimal coordination strategies are the ones for which there exists no strategy that would be better for both robots. The problem is equivalent to computing geodesics in the coordination space which is the Cartesian product of the roadmap with itself. We extend visibility graphs to solve the problem. If the roadmap is acyclic, then our algorithm has O(mn2 log n) time complexity, in which m is the number of paths in the roadmap, and n is the number of coordination space vertices. For cyclic roadmaps, our algorithm computes solutions in time O(25alpham1+5alpha n2 log(m2alpha n)), in which alpha = 1 + [(5ℓ + r)/ b] where ℓ is total length of the roadmap, r is total length of coordination space obstacle boundary, and b is the length of the shortest edge in the roadmap. 
Issue Date:  2008 
Type:  Text 
Language:  English 
Description:  137 p. Thesis (Ph.D.)University of Illinois at UrbanaChampaign, 2008. 
URI:  http://hdl.handle.net/2142/81808 
Other Identifier(s):  (MiAaPQ)AAI3314745 
Date Available in IDEALS:  20150925 
Date Deposited:  2008 
This item appears in the following Collection(s)

Dissertations and Theses  Computer Science
Dissertations and Theses from the Dept. of Computer Science 
Graduate Dissertations and Theses at Illinois
Graduate Theses and Dissertations at Illinois