Reusing cost-minimal paths for goal-directed navigation in partially known terrains

Autonomous Agents and Multi-Agent Systems, Volume 29, Issue 5, 2015, Pages 850.0-895.0.

Cited by: 6|Views24


Situated agents frequently need to solve search problems in partially known terrains in which the costs of the arcs of the search graphs can increase (but not decrease) when the agents observe new information. An example of such search problems is goal-directed navigation with the freespace assumption in partially known terrains, where ag...More



Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :