cs.RO · 2605.03662 Copy arXiv ID · May 5, 2026 Save Feasibility-aware Hybrid Control for Motion Planning under Signal Temporal Logics Authors: Panagiotis Rousseas , Dimos V. Dimarogonas
Organizations: ∗KTH Royal Institute of Technology, School of Electrical Engineering and Computer Science, Division of Decision and Control Systems
Abstract In this work, a novel method for planar task and motion planning based on hybrid modeling is proposed. By virtue of a discrete variable which models local constraint satisfaction and enables local feasibility analysis, the proposed control architecture unifies planning with control design. Concurrently, control barrier functions are designed on a transformed disk version of the original nonconvex and geometrically complex robotic workspace, thus amending the issue of deadlocks. Simulations of the proposed method indicate effective handling of multiple overlapping spatio-temporal tasks even in the face of input saturation.
Explore similar work Jun 8, 2026 · Alejandro Gonzalez-Garcia, Dries Dirckx, Jan Swevers +1 Motion Planners Obstacle Avoidance
Jul 21, 2026 · Nicola De Carli, Gregorio Marchesini, Dimos V. Dimarogonas Signal Temporal Logic Planning Methods
May 22, 2026 · Yu Chen, Ancheng Hou, Mingyang Feng +2 Signal Temporal Logic Motion Planners
Jun 8, 2026 · cs.RO J/K move · Enter open · S save
Alejandro Gonzalez-Garcia, Dries Dirckx, Jan Swevers, Wilm Decré
Autonomous mobile robots operating in tight environments require motion planning frameworks that account for the physical footprint of the robot. Simplifying the geometry to a point or a circle is conservative and discards information needed to successfully and safely traverse narrow passages. This work proposes a safe local motion planning and control method that guarantees that a polytopic robot footprint stays inside a continuously updated convex free-space region. The containment condition is formulated as a set of discrete-time control barrier function constraints within a model predictive controller. The number of safety constraints depends on the complexity of the local free-space geometry and the robot shape, instead of the number of obstacles. The proposed free-space formulation does not need any obstacle detection or segmentation. A comparative analysis against a polytope-based obstacle avoidance formulation confirms favorable scaling up to a reduction of 91
× \times × in computation time as the number of obstacles increases. The approach is validated in simulation with an autonomous surface vehicle and on hardware with a non-holonomic mobile robot, using both occupancy grids and LiDAR sensing. The experiments demonstrate safe real-time motion planning and control at 10~Hz on an onboard embedded computer, including reactive avoidance of dynamic obstacles.