The goal of this agent is to keep the risk of losing the target as low as possible. While the Target Tracker's goal is to locate the target by maintaining it in the camera's view field, this agent tries to keep a reasonable amount of known landmarks, as non collinear as possible, in the surroundings of the robot. The rationale is to have as many visible landmarks as possible so that the Map Manager is able to compute the location of the target using the beta-coefficient system when it is not visible nor in the Visual Memory. The fewer surrounding landmarks whose locations are known, the more risky is the current situation and the higher the probability of losing the target and getting lost. Also, the more collinear the landmarks, the higher the error in the location of the target, and thus, the higher the imprecision on its location.
We model the risk as a function that combines: 1) the number of
landmarks ahead (elements in set ), 2) the number of
landmarks around (elements in set
), and 3) their
``collinearity quality'' (
and
). As we have described, these qualities are computed by
the Map Manager. A minimum risk of 0 is assessed when there
are at least six visible landmarks in the direction of the
movement and minimally collinear.
Although the locations of only three landmarks are needed in order to use the
beta-coefficient system, we want to have additional landmarks
around the robot whose locations are known, so that there are more chances to compute the
target's location.
A maximum risk of 1 is assessed when there are no landmarks ahead nor around:
Given that the robot cannot decrease the
collinearity of the visible landmarks, the only way to decrease the risk level
is by increasing the number of landmarks ahead and around. Having
more landmarks, besides increasing or
, also
helps by possibly increasing the qualities
and
.
We encourage having landmarks ahead by bidding
![]() |
The behavior of this agent also helps the Map Manager build the map when the robot is in an unexplored area. Since it bids for looking for landmarks when there are not many visible, its bids will be high, and thus new landmarks (if there are landmarks, obviously) will be identified and the map will be updated.
© 2003 Dídac Busquets