31:
which pits a hypothetical runner, who can only move slowly, but is highly maneuverable, against the driver of a motor vehicle, which is much faster but far less maneuverable, who is attempting to run him down. Both runner and driver are assumed to never tire. The question to be solved is: under what
96:, chapter 16), where a squad car of speed 2 chases a crook of speed 1 on a rectangular grid, where the squad car but not the crook is constrained not to make left-hand turns or U-turns.
32:
circumstances, and with what strategy, can the driver of the car guarantee that he can always catch the pedestrian, or the pedestrian guarantee that he can indefinitely elude the car?
81:
methods can be used as a mathematical framework for investigating solutions of the problem. Although the problem is phrased as a recreational problem, it is an important
236:
226:
241:
231:
124:, another mathematical game which pits a powerful and maneuverable adversary against a highly resourceful but less powerful foe
221:
47:
115:
127:
176:
Differential Games: A Mathematical Theory with
Applications to Warfare and Pursuit, Control and Optimization
74:
105:
150:
82:
206:
43:
and other military targeting, allowing scientists to publish on it without security implications.
62:
193:, presentation at the Colloquium dedicated to the 60th anniversary of Prof. Pierre Bernhard.
110:
51:
66:
40:
28:
89:
215:
121:
36:
190:
70:
20:
196:
162:
78:
201:
202:
Homicidal
Chauffeur Game. Computation of Level Sets of the Value Function
197:
Analytical study of a case of the homicidal chauffeur game problem
151:
https://demonstrations.wolfram.com/TheHomicidalChauffeurProblem/
85:
for mathematics used in a number of real-world applications.
178:, John Wiley & Sons, New York (1965), PP 349–350.
61:
The homicidal chauffeur problem is a classic example of a
145:
Becker, A. T., & Garcia, J. (2018, January 22).
88:A discrete version of the problem was described by
8:
191:History of the Homicidal Chauffeur Problem
138:
7:
149:. The Homicidal Chauffeur Problem.
14:
35:The problem is often used as an
207:The Homicidal Chauffeur Problem
147:Wolfram Demonstrations Project
1:
46:The problem was proposed by
16:Mathematical pursuit problem
25:homicidal chauffeur problem
258:
116:Apollonius pursuit problem
165:, RAND Corporation (1951)
128:Princess and Monster game
50:in a 1951 report for the
237:Game theory game classes
227:Recreational mathematics
242:Multivariable calculus
232:Calculus of variations
75:calculus of variations
94:Mathematical Carnival
106:Variational calculus
56:Differential Games
54:, and in the book
27:is a mathematical
63:differential game
249:
179:
172:
166:
163:Games of Pursuit
159:
153:
143:
111:Level-set method
69:in a continuous
52:RAND Corporation
257:
256:
252:
251:
250:
248:
247:
246:
222:Pursuit–evasion
212:
211:
187:
182:
173:
169:
160:
156:
144:
140:
136:
102:
67:continuous time
41:missile defense
29:pursuit problem
17:
12:
11:
5:
255:
253:
245:
244:
239:
234:
229:
224:
214:
213:
210:
209:
204:
199:
194:
186:
185:External links
183:
181:
180:
167:
154:
137:
135:
132:
131:
130:
125:
118:
113:
108:
101:
98:
90:Martin Gardner
15:
13:
10:
9:
6:
4:
3:
2:
254:
243:
240:
238:
235:
233:
230:
228:
225:
223:
220:
219:
217:
208:
205:
203:
200:
198:
195:
192:
189:
188:
184:
177:
171:
168:
164:
158:
155:
152:
148:
142:
139:
133:
129:
126:
123:
122:Angel problem
119:
117:
114:
112:
109:
107:
104:
103:
99:
97:
95:
92:(in his book
91:
86:
84:
83:model problem
80:
76:
72:
68:
64:
59:
57:
53:
49:
44:
42:
38:
33:
30:
26:
22:
175:
170:
157:
146:
141:
93:
87:
60:
55:
48:Rufus Isaacs
45:
37:unclassified
34:
24:
18:
174:R. Isaacs,
161:R. Isaacs,
71:state space
21:game theory
216:Categories
134:References
65:played in
39:proxy for
120:Conway's
79:level set
100:See also
73:. The
23:, the
77:and
19:In
218::
58:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.