Real-time scheduling of mobile agents using answer set programming

Scheduling is required in a multitude of domains: public transportation, logistics, delivery of goods, events, component delivery for production plants or in the case of assembly lines. Most of the times, the scheduled activities are performed by agents, either humans or autonomous systems, operating in complex environments subject to change during the agents operation. Usually these changes in the environment have an impact on the initial data based upon which the scheduling was performed thus requiring new working configurations to be generated for the agents. This paper presents the solving of a scheduling problem which extends the traveling salesman scenario through the use of ASP (Answer Set Programming). The method was integrated and tested in the CoReMo simulator whose goal is to provide a platform for the development and evaluation of novel algorithms dealing with event-driven configuration systems.