Spelling suggestions: "subject:"pursuitevasion game"" "subject:"pursuasion game""
1 |
Variational Approach to Pursuit-Evasion Game with Curvature ConstraintChu, Hung-Jen 12 June 2000 (has links)
In this thesis, a pursuit-evasion game, in which the pursuer moves with simple motion whereas the evader moves at a fixed speed but with a curvature constraint, is investigated. The game is the inverse of the usual homicidal chauffeur game. Square of the distance between the pursuer and the evader when the game is terminated is selected as the cost function. To solve such a zero-sum game, the variational approach will be employed to solve the problem. An algorithm will be proposed to determine a saddle point and the value of the game under consideration
|
2 |
Cops and Robber Game with a Fast RobberMehrabian, Abbas January 2011 (has links)
Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to several well-known parameters in graph theory. One popular variant is called the Cops and Robber game, where the searchers (cops) and the fugitive (robber) move in rounds, and in each round they move to an adjacent vertex. This game, defined in late 1970's, has been studied intensively. The most famous open problem is Meyniel's conjecture, which states that the cop number
(the minimum number of cops that can always capture the robber) of a connected graph
on n vertices is O(sqrt n).
We consider a version of the Cops and Robber game, where the robber is faster than the cops, but is not allowed to jump over the cops. This version was first studied in 2008.
We show that when the robber has speed s,
the cop number of a connected n-vertex graph can be as large as Omega(n^(s/s+1)). This improves the Omega(n^(s-3/s-2)) lower bound of Frieze, Krivelevich, and Loh (Variations on Cops and Robbers, J. Graph Theory, to appear). We also conjecture a general upper bound O(n^(s/s+1)) for the cop number,
generalizing Meyniel's conjecture.
Then we focus on the version where the robber is infinitely fast, but is again not allowed to jump over the cops. We give a mathematical characterization for graphs with cop number one. For a graph with treewidth tw and maximum degree Delta,
we prove the cop number is between (tw+1)/(Delta+1) and tw+1. Using this we show that the cop number of the m-dimensional hypercube is
between c1 n / m sqrt(m) and c2 n / m for some constants c1 and c2. If G is a connected interval graph on n vertices, then we give a polynomial time 3-approximation algorithm for finding the cop number of G, and prove that the cop number is O(sqrt(n)).
We prove that given n, there exists a connected chordal graph on n vertices
with cop number Omega(n/log n). We show a lower bound for the cop numbers of expander graphs, and use this to prove that the random G(n,p) that is not very sparse,
asymptotically almost surely has cop number between d1 / p and d2 log (np) / p for suitable constants d1 and d2. Moreover, we prove that a fixed-degree regular random graph with n vertices asymptotically almost surely has cop number Theta(n).
|
3 |
Cops and Robber Game with a Fast RobberMehrabian, Abbas January 2011 (has links)
Graph searching problems are described as games played on graphs, between a set of searchers and a fugitive. Variants of the game restrict the abilities of the searchers and the fugitive and the corresponding search number (the least number of searchers that have a winning strategy) is related to several well-known parameters in graph theory. One popular variant is called the Cops and Robber game, where the searchers (cops) and the fugitive (robber) move in rounds, and in each round they move to an adjacent vertex. This game, defined in late 1970's, has been studied intensively. The most famous open problem is Meyniel's conjecture, which states that the cop number
(the minimum number of cops that can always capture the robber) of a connected graph
on n vertices is O(sqrt n).
We consider a version of the Cops and Robber game, where the robber is faster than the cops, but is not allowed to jump over the cops. This version was first studied in 2008.
We show that when the robber has speed s,
the cop number of a connected n-vertex graph can be as large as Omega(n^(s/s+1)). This improves the Omega(n^(s-3/s-2)) lower bound of Frieze, Krivelevich, and Loh (Variations on Cops and Robbers, J. Graph Theory, to appear). We also conjecture a general upper bound O(n^(s/s+1)) for the cop number,
generalizing Meyniel's conjecture.
Then we focus on the version where the robber is infinitely fast, but is again not allowed to jump over the cops. We give a mathematical characterization for graphs with cop number one. For a graph with treewidth tw and maximum degree Delta,
we prove the cop number is between (tw+1)/(Delta+1) and tw+1. Using this we show that the cop number of the m-dimensional hypercube is
between c1 n / m sqrt(m) and c2 n / m for some constants c1 and c2. If G is a connected interval graph on n vertices, then we give a polynomial time 3-approximation algorithm for finding the cop number of G, and prove that the cop number is O(sqrt(n)).
We prove that given n, there exists a connected chordal graph on n vertices
with cop number Omega(n/log n). We show a lower bound for the cop numbers of expander graphs, and use this to prove that the random G(n,p) that is not very sparse,
asymptotically almost surely has cop number between d1 / p and d2 log (np) / p for suitable constants d1 and d2. Moreover, we prove that a fixed-degree regular random graph with n vertices asymptotically almost surely has cop number Theta(n).
|
4 |
Online problems and two-player games algorithms and analysis /Sivadasan, Naveen. Unknown Date (has links) (PDF)
University, Diss., 2004--Saarbrücken.
|
5 |
Some Aspects of Differential Game ProblemsLee, Yuan-Shun 28 January 2002 (has links)
ABSTRACT
Usually, real game problems encountered in our daily lives are so complicated that the existing methods are no longer sufficient to deal with them. This motivates us to investigate several kinds of differential game problems, which have not been considered or solved yet, including a pursuit-evasion game with n pursuers and one evader, a problem of guarding a territory with two guarders and two invaders, and a payoff-switching differential game.
In this thesis, firstly the geometric method is used to consider the pursuit-evasion game with n pursuers and one evader. Two criteria used to find the solutions of the game in some cases are given. It will be shown that the one-on-one pursuit-evasion game is a special case of this game.
Secondly, the problem of guarding a territory with two guarders and two invaders is considered both qualitatively and quantitatively. The investigation of this problem reveals a variety of situations never occurring in the case with one guarder and one invader. An interesting thing found in this investigation is that some invader may play the role as a pursuer for achieving a more favorable payoff in some cases. This will make the problem more complicated and more difficult to be solved.
The payoff-switching differential game, first proposed by us, is a kind of differential game with incomplete information. The main difference between this problem and traditional differential games is that in a payoff-switching differential game, any one player at any time may have several choices of payoffs for the future. The optimality in such a problem becomes questionable. Some reasoning mechanisms based on different methods will be provided to determine a reasoning strategy for some player in a payoff-switching differential game. A practical payoff-switching differential game problem, i.e., the guarding three territories with one guarder against one invader, is presented to illustrate the situations of such a game problem. Many computer simulations of this example are given to show the performances of different reasoning strategies. The proposition of the payoff-switching differential game is an important breakthrough in dealing with some kinds of differential games with incomplete information.
|
6 |
Safe Controller Design for Intelligent Transportation System Applications using Reachability AnalysisPark, Jaeyong 17 October 2013 (has links)
No description available.
|
Page generated in 0.0507 seconds