Optimal Control for a Two Player Dynamic Pursuit Evasion Game; The Herding Problem
| dc.contributor.author | Shedied, Samy Aly | en |
| dc.contributor.committeechair | Kachroo, Pushkin | en |
| dc.contributor.committeemember | Baumann, William T. | en |
| dc.contributor.committeemember | VanLandingham, Hugh F. | en |
| dc.contributor.committeemember | Mili, Lamine M. | en |
| dc.contributor.committeemember | Reinholtz, Charles F. | en |
| dc.contributor.department | Electrical and Computer Engineering | en |
| dc.date.accessioned | 2014-03-14T20:07:08Z | en |
| dc.date.adate | 2002-02-06 | en |
| dc.date.available | 2014-03-14T20:07:08Z | en |
| dc.date.issued | 2002-01-22 | en |
| dc.date.rdate | 2003-02-06 | en |
| dc.date.sdate | 2002-02-04 | en |
| dc.description.abstract | In this dissertation we introduce a new class of pursuit-evasion games; the herding problem. Unlike regular pursuit evasion games where the pursuer aims to hunt the evader the objective of the pursuer in this game is to drive the evader to a certain location on the x-y grid. The dissertation deals with this problem using two different methodologies. In the first, the problem is introduced in the continuous-time, continuous-space domain. The continuous time model of the problem is proposed, analyzed and we came up with an optimal control law for the pursuer is obtained so that the evader is driven to the desired destination position in the x-y grid following the local shortest path in the Euler Lagrange sense. Then, a non-holonomic realization of the two agents is proposed. In this and we show that the optimal control policy is in the form of a feedback control law that enables the pursuer to achieve the same objective using the shortest path. The second methodology deals with the discrete model representation of the problem. In this formulation, the system is represented by a finite di-graph. In this di-graph, each state of the system is represented by a node in the graph. Applying dynamic programming technique and shortest path algorithms over the finite graph representing the system, we come up with the optimal control policy that the pursuer should follow to achieve the desired goal. To study the robustness, we formulate the problem in a stochastic setting also. We analyze the stochastic model and derive an optimal control law in this setting. Finally, the case with active evader is considered, the optimal control law for this case is obtained through the application of dynamic programming technique. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-02042002-152330 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-02042002-152330/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/26110 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | Dissertation.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | Shortest Path | en |
| dc.subject | Dynamic Programming | en |
| dc.subject | Non-holonomic Systems | en |
| dc.subject | Pursuit Evasion | en |
| dc.title | Optimal Control for a Two Player Dynamic Pursuit Evasion Game; The Herding Problem | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Electrical and Computer Engineering | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1