Previous Next

Challenge Problem

We divide the problem into three parts:
- Create one and only one target agent for each target in the world.
  - First one gets all the attention. Targets die of starvation
- Target agent determines its location based on returns from the sensors.
  - Use Bayes networks.
- Allocate the sensors so they effectively cover the maximum numbers of targets with minimum cost.
  - A dynamic service allocation problem.

Jose M. Vidal - University of South Carolina

1

03 August 2000, 10:01PM