A Heuristic Approach to the Multiagent Pursuit and Evasion Problem in Polygonal Enviroments
In this paper heursitic algorithms are developed for the pursuit evasion problem in polygonal enviroments. In this problem, continuous trajectories shall be constructed for a group of pursuers, searching for an evader, in such a way that the evader is guaranteed to be seen at some time during the se...
| Main Authors: | , , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Optimeringslära och systemteori
2011
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105488 |