Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Homicidal_chauffeur_problem> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Homicidal_chauffeur_problem abstract "In game theory, the homicidal chauffeur problem is a mathematical pursuit problem 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 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?The problem was proposed by Rufus Isaacs (game theorist) in his classic book Differential Games, John Wiley and Sons, 1965.The homicidal chauffeur problem is a classic example of a differential game played in continuous time in a continuous state space. The calculus of variations and level set 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 model problem for mathematics used in a number of real-world applications.A discrete version of the problem was described by Martin Gardner (in his book Mathematical Carnival, 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.".
- Homicidal_chauffeur_problem wikiPageExternalLink 350554.html.
- Homicidal_chauffeur_problem wikiPageExternalLink nice4.pdf.
- Homicidal_chauffeur_problem wikiPageExternalLink f466qu1820h00330.
- Homicidal_chauffeur_problem wikiPageID "15007740".
- Homicidal_chauffeur_problem wikiPageRevisionID "604562020".
- Homicidal_chauffeur_problem hasPhotoCollection Homicidal_chauffeur_problem.
- Homicidal_chauffeur_problem subject Category:Calculus_of_variations.
- Homicidal_chauffeur_problem subject Category:Game_theory.
- Homicidal_chauffeur_problem subject Category:Mathematical_optimization.
- Homicidal_chauffeur_problem subject Category:Multivariable_calculus.
- Homicidal_chauffeur_problem subject Category:Recreational_mathematics.
- Homicidal_chauffeur_problem comment "In game theory, the homicidal chauffeur problem is a mathematical pursuit problem 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.".
- Homicidal_chauffeur_problem label "Homicidal chauffeur problem".
- Homicidal_chauffeur_problem sameAs m.03h4hh5.
- Homicidal_chauffeur_problem sameAs Q5890773.
- Homicidal_chauffeur_problem sameAs Q5890773.
- Homicidal_chauffeur_problem wasDerivedFrom Homicidal_chauffeur_problem?oldid=604562020.
- Homicidal_chauffeur_problem isPrimaryTopicOf Homicidal_chauffeur_problem.