Path-Cost Bounds for Parameterized Centralized Variants of A* for Static and Certain Environments.
Amol Dattatraya MaliMinh TangPublished in: Int. J. Artif. Intell. Tools (2016)
Keyphrases
- sum of squared errors
- minimum cost
- lower bound
- upper bound
- real world
- total cost
- worst case
- dynamic environments
- worst case bounds
- optimal path
- optimal cost
- shortest path
- peer to peer
- lowest cost
- special case
- branch and bound search
- distributed environment
- upper and lower bounds
- high cost
- multi class
- np hard
- multi agent