Cooperation & Pursuit and Evasion Games

Introduction to Pursuit-Evasion Algorithms

Problem Breakdown.

Pursuit-Evasion algorithms are typically divided into three parts:

  • Multiple Target Tracking (MTT): understand the playing field via sensory input
  • Pursuer-Evader Assignment (PEA): assign an evader to each pursuer
  • Path-Planning (PP): given the assignment, determine the optimal route for each palyer.

Each of the following is encoded in the "behaviors" in the applet above. In future versions, look for algorithm/behavioral choices for each of these three problems.

Control vs Cooperation.

One of the major goals of my research is to determine how cooperative algorithms compare to control algorithms. The fundamental difference is that control algorithms use a centralized processor to solve specific pieces of the problem, usually determining some sort of optimal solution for the PEA problem. In a cooperative environment, there is no centralized control, and players must autonomously gather and share data, determine an acceptable assignment of pursuers to evaders, and plot their own paths, all without the aid of a centralized processor. In future versions, look for both control and autonomous algorithms, as well as the ability to generate statistics to compare multiple algorithms.

Papers and Preprints

  • "Cooperation in a Network: Agent Metrics and Cooperation Space" (with Chris Arney), Proceedings of the 2010 Army Science Conference. PDF
  • "Subset Team Games and Cooperation Space: Theory and Application" , technical report for the 2009 ARL-USMA Technical Symposium, Atlantic City, NJ.
  • "Cooperation in a Network: Theoretical Considerations" (with Chris Arney), technical report for the 2009 USMA Network Science Workshop, West Point, NY.
  • "Cooperation in a Network: Altruism increases Flow" (with Chris Arney), technical report for the 2009 USMA Network Science Workshop, West Point, NY.
  • "Cooperation in Social Networks: Communication, Trust, and Selflessness" (with Chris Arney), Proceedings of the 2008 Army Science Conference (chosen Best Paper in the Advanced Modeling and Simulation Category, and 3rd Best Paper Overall out of 845 abstract entries). PDF
  • "A mathematical formalism for selfish and altruistic cooperation in social networks" (with Chris Arney), technical report for the 2007 USMA Network Science Workshop, West Point, NY. PDF

Talks

  • "Subset Team Games, Cooperation Space, and Pursuit-Evasion Simulations" , 2009 ARL-USMA Technical Symposium, Nov 9, 2009.
  • "Cooperation in a Network: Theoretical Considerations" (with Chris Arney), USMA Network Science Workshop, West Point, NY, Oct 29, 2009. PDF slides
  • "The Mathematics of Pursuit and Evasion" , USMA Math Forum, March 26, 2009. PDF slides
  • "Cooperation in Social Networks: Communication, Trust, and Selflessness" (with Chris Arney), Army Science Conference, Orlando, FL, Dec 2, 2008. PPTX Slides
  • "Dynamic Mathematics and Pursuit-Evasion Games" , USMA Department of Mathematical Sciences Center for Faculty Development (Colloquium), Nov 20, 2008. PDF slides and PPTX slides and Applets Page
  • "The Mathematics of Altruism and Selfish Cooperation" (with Chris Arney), ARL-USMA Technical Symposium, Atlantic City, NJ, Oct 23, 2008. PPTX slides
  • "Altruism and Selfish Cooperation in Social Networks" (with Chris Arney and Lucas Gebhart), USMA Network Science Workshop, Oct 16, 2008. PPTX slides
  • "Cooperating Teams in Pursuit-Evasion Games" , ARL-USMA Technical Symposium, Oct 30, 2007. PPT slides
  • "Social Network Optimization and Synergy in Cooperative Systems: Trust & Selflessness" , USMA Network Science Workshop, Oct 23, 2007. PPT slides
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License