As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much work has been done on this problem with a single entity in a continuous environment. However these entities may be in teams and their actions may be constrained by the need to consider the actions of other entities. We consider the case of two entities wishing to reach their destinations while travelling the minimum distance and remaining in sight of each other. A version of this problem in continuous space has been addressed previously; however, the problem of minimum length paths does not only exist in continuous space. Robots may have restricted orientations in movement. Also, domains such as circuit design and computer games require discrete movements and restricted orientation. The restricted orientation and the fact that (even in genus zero environments) minimal length paths may not be unique present some challenges.This paper investigates the problem of two entities in a discrete setting, moving to preserve visibility and provides algorithms for computing schedules that minimise the total distance travelled.
机译:V-LAB〜(〜R)-用于自治Agent模拟的分布式智能离散事件环境
机译:在混合CPU / GPU环境中通过基于模因代理的系统努力实现离散优化的性能
机译:体现在eHealth中的会话代理商:对积极和中性情绪的面部和文本表达如何影响对相互理解的看法
机译:在离散环境中相互可见的代理
机译:匹配决策者的联合响应模型:相互选择代理的决策机制探索。
机译:估计具有有限样本的两个离散非对称变量之间的相互信息
机译:离散环境中的相互可见代理