In computer games, one or more groups of units need to move from one location to another as quickly as possible. If there is only one group, then it can be solved efficiently as a ...
Marjan van den Akker, Roland Geraerts, Han Hoogeve...
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...