Mobility problems in distributed search and combinatorial games
This thesis examines a collection of topics under the general notion of mobility of agents. We examine problems where a set of entities, perceived as robots or tokens, navigate in some given (discrete or continuous) environment to accomplish a goal. The problems we consider fall under two main resea...
Main Author: | Lamprou, I. |
---|---|
Other Authors: | Martin, Russell ; Schewe, S. |
Published: |
University of Liverpool
2018
|
Online Access: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.762836 |
Similar Items
-
Solving Games and Improving Search Performance with Embedded Combinatorial Game Knowledge
by: Shan, Yi-Chang, et al.
Published: (2013) -
Variable Neighborhood Search for Combinatorial Problems
by: Min-Hua Lo, et al.
Published: (2010) -
The Application of Tabu Search To Combinatorial Optimization Problems
by: Wei-Chu Weng, et al.
Published: (2002) -
Neighbourhood search techniques for multi-objective combinatorial problems
by: Marett, Richard Colin
Published: (1995) -
Parallel Hybrid Search Algorithms for Combinatorial Optimization Problems
by: Chen, Wei-Chih, et al.
Published: (2012)