Spatial distribution statistics for two-agent optimal navigation with cone-shaped local observation

Jan De Mot, Eric Feron

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

In this paper, we study spatially synchronous two-agent navigation on a structured partially unknown graph. The general edge cost statistics are given, and the agents gather and share exact information on the cost of local edges. The agents purpose is to traverse the graph as efficiently as possible. In previous work, we formulate the problem as a Dynamic Program, and exploit the structure of an equivalent Linear Program to compute the optimal value function. Here, we use the optimal policy to formulate a Markov chain with an infinite number of states whose properties we analyze. We present a method that computes the steady state probability distribution of the agent separation, exploiting the repetitive structure of the Markov chain as the agent separation goes to infinity. The results confirms and quantify the intuition that the less rewards, the more beneficial for the agents to spread out. ©2005 AACC.
Original languageEnglish (US)
Title of host publicationProceedings of the American Control Conference
Pages1877-1882
Number of pages6
StatePublished - Sep 1 2005
Externally publishedYes

Fingerprint Dive into the research topics of 'Spatial distribution statistics for two-agent optimal navigation with cone-shaped local observation'. Together they form a unique fingerprint.

Cite this