Sequential control barrier functions for mobile robots with dynamic temporal logic specifications.

We address a motion planning and control problem for mobile robots to satisfy rich, time-varying tasks expressed as Signal Temporal Logic (STL) specifications. The specifications may include tasks with nested temporal operators or time-conflicting requirements (e.g., achieving periodic tasks or tasks defined within the same time interval). Moreover, the tasks can be defined in locations changing with time (i.e., dynamic targets), and their future motions are not known a priori. This unpredictability requires an online control approach which motivates us to investigate the use of control barrier functions (CBFs). The proposed CBFs take into account the actuation limits of the robots and a feasible sequence of STL tasks. They define time-varying feasible sets of states the system must always stay inside. We show the feasible sequence generation process that even includes the decomposition of periodic tasks and alternative scenarios due to disjunction operators. The sequence is used to define CBFs, ensuring STL satisfaction. We also show some theoretical results on the correctness of the proposed method. We illustrate the benefits of the proposed method and analyze its performance via simulations and experiments with aerial robots. • A robot must satisfy a signal temporal logic (STL) specification by visiting time-varying regions. • The future trajectories of time-varying regions are unknown. • The STL specification may include nested temporal operators or time-conflicting requirements. • We propose Sequential CBFs to drive a robot to its dynamic targets based on its STL specification. • The proposed algorithm is supported by theoretical results and tested via experiments. [ABSTRACT FROM AUTHOR]