Optimal control for a robotic exploration, pick-up and delivery problem

Different versions of this problem have received is coping with uncertainties arising from limited a-considerable attention from several research communities, e.g., priori knowledge of the environment. Acquiring necessary as a "pursuit-evasion game" in game theory [13], [14], as information and achieving the overall goal are complementary a "cow-path problem" in computer science [15] or as a subtasks that require adapting the motion of a robot during "coverage problem" in control [16], [17], but its solution for mission execution, typically accompanied by minimizing a a general probability distribution or a general geometry of the performance criterion. In this work we address an Optimal region is, to a large extent, still an open question. Effective Control Problem (OCP) for a robot with fourth-order dynamics approaches for the related persistent monitoring problem based that has to find, collect and move a finite number of on estimation [18], linear programming [19] or parametric objects to a designated spot in minimum time. The objects optimization [20] have been also been proposed. OCPs with with a-priori known masses are located in a bounded twodimensional uncertainties have also been addressed by certainty equivalent space, where the robot is capable of localizing event-triggered [21], minimax [22] and sampling-based [23] itself using a state-of-the-art simultaneous localization and optimization schemes.