We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
This paper presents multiDE, an extension of Price and Storn's differential evolution (DE) algorithm that consistently outperforms state-of-the-art search techniques for iden...
Imitation represents a powerful approach for programming and autonomous learning in robot and computer systems. An important aspect of imitation is the mapping of observations to ...