Path Planning for a Cooperative Navigation Aid Vehicle to Assist Multiple Agents Sequentially
Abstract: This paper considers planning a path for a single underwater cooperative navigation aid (CNA) vehicle to sequentially aid a set of N agents to minimize average navigation uncertainty. Both the CNA and agents are modeled as constant-velocity vehicles. The agents travel along known nominal trajectories and the CNA plans a path to sequentially intercept them. Navigation aiding is modeled by a scalar discrete time Kalman filter. During path planning, the CNA considers surfacing to reduce its own navigation uncertainty. A greedy planning algorithm is proposed that uses a heuristic to schedule agents to the CNA that is based on the optimal time-to-aid, the overall navigation uncertainty reduction, and the transit time. The approach is compared to an optimal (exhaustive enumeration) algorithm through a Monte Carlo experiment with randomized agent trajectories and initial navigation uncertainty.
- Cooperative localization for autonomous underwater vehicles. Int. J. Robotics Research, 28(6), 714–728.
- Chitre, M. (2010). Path planning for cooperative underwater range-only navigation using a single beacon. In 2010 Int. Conf. Autonomous and Intelligent Sys., 1–6.
- Observability based control in range-only underwater vehicle localization. In Proc. American Control Conf., 4702–4707.
- Simon, D. (2006). Optimal state estimation: Kalman, H infinity, and nonlinear approaches. John Wiley & Sons.
- Single beacon cooperative path planning using cross-entropy method. IEEE/MTS OCEANS’11 Conf. Expo., 1–6.
- Experimental validation of the moving long base-line navigation concept. In 2004 IEEE/OES Autonomous Underwater Vehicles, 59–65.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.