Anytime Heuristic for Determining Agent Paths That Minimize Maximum Latency in a Sparse DTN.
Achudhan SivakumarColin Keng-Yan TanPublished in: ICTAI (2011)
Keyphrases
- multi agent systems
- multi agent
- intelligent agents
- multiagent systems
- agent model
- autonomous agents
- mobile agents
- software agents
- optimal solution
- decision making
- agent systems
- dynamic programming
- search algorithm
- simulated annealing
- sparse data
- prefetching
- agent architecture
- agent technology
- pedagogical agents
- exploration strategy
- sparse representation
- low latency
- genetic algorithm
- multiple agents
- feasible solution
- combinatorial optimization
- response time
- tabu search
- shortest path