Title

A Heuristic Task Scheduling For Multi-Pursuer Multi-Evader Games

Keywords

Heuristic; Multi-Pursuer Multi-Evader; Negotiation; Optimization; Task Scheduling

Abstract

This paper introduces a divide-and-conquer, heuristic task scheduling optimization approach on the challenging multi-pursuer multi-evader (MPME) games in which pursuers attempt to minimize the time to capture all evaders whereas evaders try to maximize the capture time. The MPME task scheduling problem is solved through a two-step hierarchical approach. At the high level, the game is divided into a number of subgames or teams using a combination of Voronoi diagram and a negotiation-based mechanism (through heuristic objective functions) to make the pursuit more efficient. At the low level, pursuers within each team are directed locally by their team leader to pursue an evader which runs slower or faster. We mainly focus on a position scheduling problem of how pursuers in a team can surround a faster evader as quickly as possible before entering into the capture phase. Instead of using computation intensive approaches, we use heuristics to solve the complex scheduling problems. In addition to focusing on the pursuer side, evader cooperation is also briefly discussed. Simulation results show the effectiveness of the proposed approach. © 2011 IEEE.

Publication Date

8-15-2011

Publication Title

2011 IEEE International Conference on Information and Automation, ICIA 2011

Number of Pages

528-533

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/ICINFA.2011.5949050

Socpus ID

80051512157 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/80051512157

This document is currently not available here.

Share

COinS