CPS: Small: Real-time, Simulation-based Planning and Asynchronous Coordination for Cyber-Physical Systems
The project aims to develop abstractions and general solutions for autonomous planning and coordination in networks of cyber--physical systems. In particular, the following challenges were identified in order to achieve the above objective:
Develop abstractions and sampling-based motion planning algorithms that can be appropriately integrated with simulation tools to utilize their predictive capabilities without requiring detailed or well-behaved mathematical models.
We have developed methods for improving the performance of sampling-based algorithms, which do not depend on the knowledge of a specific model and which can operate given a simulation tool to model the underlying system. In the meanwhile, an important development in the motion planning community has been the proposition of motion planners that provide asymptotic optimality guarantees. These methods, however, have significant computational requirements. We have proposed a series of algorithms that provide asymptotic near-optimality guarantees and which require significantly reduced computational resources.
Address safety issues that arise due to the presence of real-time constraints, such as operating in dynamic and partially-observable environments, and especially given asynchronous coordination protocols between multiple agents towards providing safety guarantees.
We have provided a report that summarizes the state-of-the-art in addressing safety issues in the context of real--time planning. This line of work has been extended to the case of multiple coordinating vehicles that utilize asynchronous communication in order to navigate in a common environment, while achieving safety guarantees. We have also developed methods for the decentralized, collision-free coordination of multiple agents, which involves either no or very limited communication.
Study how inconsistent estimation and partial knowledge among multiple agents of a team affects distributed decision-making and work towards applications in CPS domains.
We have developed methods for computing paths for multiple agents in a decentralized, localized manner on discrete representations by utilizing static sensors, which are able to communicate with the agents. The focus of this work has been on transportation scenarios, which is one of the CPS application domains for this project. A drawback of this type of methods is the lack of completeness guarantees. This motivated the development of methods with completeness guarantees for a broad range of multi-agent path planning instances on discrete representations, which have polynomial complexity. This project has also led into the specification of an open--access, decentralized architecture for the control of the power network, as well as the development of closed-loop methods for the control of medical devices.
Develop and distribute open-source planning and control software which provides appropriate abstraction tools so as to be applied to a variety of CPS applications;
An initial version of the proposed open--source planning and control software has been completed and a related paper will appear to the upcoming Simulation, Modeling and Programming Autonomous Robots conference, which illustrates the capabilities of the platform.