A Submodular Receding Horizon Control Strategy to Distributed Persistent Monitoring

This paper investigates the multi-agent persistent monitoring problem via a novel distributed submodular receding horizon control approach. In order to approximate global monitoring performance, with the definition of sub-modularity, the original persistent monitoring objective is divided into several local objectives in a receding horizon framework, and the optimal trajectories of each agent are obtained by taking into account the neighborhood information. Specifically, the optimization horizon of each local objective is derived from the local target states and the information received from their neighboring agents. Based on the sub-modularity of each local objective, the distributed greedy algorithm is proposed. As a result, each agent coordinates with neighboring agents asynchronously and optimizes its trajectory independently, which reduces the computational complexity while achieving the global performance as much as possible. The conditions are established to ensure the estimation error converges to a bounded global performance. Finally, simulation results show the effectiveness of the proposed method.

Receding Horizon Control Using Graph Search for Multi-Agent Trajectory Planning

<pre>It is hard to find the global optimum to general nonlinear, nonconvex optimization problems in reasonable time. This paper presents a method to transfer the receding horizon control approach, where nonlinear, nonconvex optimization problems are considered, into graph-search problems. Specifically, systems with symmetries are considered to transfer system dynamics into a finite state automaton. In contrast to traditional graph-search approaches where the search continues until the goal vertex is found, the transfer of a receding horizon control approach to graph-search problems presented in this paper allows to solve them in real-time. We proof that the solutions are recursively feasible by restricting the graph search to end in accepting states of the underlying finite state automaton. The approach is applied to trajectory planning for multiple networked and autonomous vehicles. We evaluate its effectiveness in simulation as well as in experiments in the Cyber-Physical Mobility Lab, an open source platform for networked and autonomous vehicles. We show real-time capable trajectory planning with collision avoidance in experiments on off-the-shelf hardware and code in MATLAB for two vehicles.</pre>

Receding Horizon Control Using Graph Search for Multi-Agent Trajectory Planning

<pre>It is hard to find the global optimum to general nonlinear, nonconvex optimization problems in reasonable time. This paper presents a method to transfer the receding horizon control approach, where nonlinear, nonconvex optimization problems are considered, into graph-search problems. Specifically, systems with symmetries are considered to transfer system dynamics into a finite state automaton. In contrast to traditional graph-search approaches where the search continues until the goal vertex is found, the transfer of a receding horizon control approach to graph-search problems presented in this paper allows to solve them in real-time. We proof that the solutions are recursively feasible by restricting the graph search to end in accepting states of the underlying finite state automaton. The approach is applied to trajectory planning for multiple networked and autonomous vehicles. We evaluate its effectiveness in simulation as well as in experiments in the Cyber-Physical Mobility Lab, an open source platform for networked and autonomous vehicles. We show real-time capable trajectory planning with collision avoidance in experiments on off-the-shelf hardware and code in MATLAB for two vehicles.</pre>