The robust linear tracking technique is applied to a practical path tracking problem for a ground vehicle modeled as a Dubins car. The tracking control is designed based on the optimal strategy in an auxiliary linear-quadratic differential game for a linearized vehicle model. In contrast with a purified theoretic setup, the real-life problem is complicated by a nonconstant speed and control saturation. Moreover, the actual path generating control can be unknown to the tracking strategy designer. These issues required additional design blocks: speed tracking loop and leading angle differentiation, both based on similar tracking algorithms. The saturation effect is considered by using command reinforcement. Numerical and experimental results are presented and compared. Robustness with respect to unknown disturbances is demonstrated. Novel analytic results on the tracking error/control effort tradeoff are also presented.
This article presents an algorithm for online multirobot coverage that proceeds with minimal knowledge of the already explored region and the frontier cells. It creates clusters of frontier cells which are designated to robots using an optimal assignment scheme. Coverage is then performed using a novel path planning technique. Many approaches that use clustering for multi-robot coverage do not specify strict time criteria for re-clustering. Moreover, the motion plans they use result in redundant coverage. To overcome these limitations, an appropriate motion plan for the robots is chosen based on the context of already covered frontiers. Dispersion of robots is vital for efficient coverage and is an emergent behavior in our approach. The efficacy of the proposed approach is tested in simulation and on a multi-robot test-bed. The algorithm performs better than some state of the art approaches.