← Search

Wolfgang Hönig

23 accepted papers

2026

db-ECBS: Interaction-Aware Multirobot Kinodynamic Motion Planning (Abstract Reprint)

AAAI 2026technical

Kinodynamic motion planning for a multirobot system with different dynamics and actuation limits is a challenging problem. The difficulty increases with the presence of aerodynamic interaction forces that occur when aerial robots fly in close proximity. Due to these complexities, existing planners e

Cited by 0SourcePDFScholar
2025

Learning Maximal Safe Sets Using Hypernetworks for MPC-Based Local Trajectory Planning in Unknown Environments

RA-L 2025

This paper presents a novel learning-based approach for online estimation of maximal safe sets for local trajectory planning in unknown static environments. The neural representation of a set is used as the terminal set constraint for a model predictive control (MPC) local planner, resulting in impr

Cited by 4SourceScholar
2025

Residual Neural Terminal Constraint for MPC-based Collision Avoidance in Dynamic Environments

CoRL 2025poster

In this paper, we propose a hybrid MPC local planner that uses a learning-based approximation of a time-varying safe set, derived from local observations and applied as the MPC terminal constraint. This set can be represented as a zero-superlevel set of the value function computed via Hamilton-Jacob…

Cited by 0SourceScholar
2024

Efficient Optimization-Based Cable Force Allocation for Geometric Control of a Multirotor Team Transporting a Payload

RA-L 2024

We consider transporting a heavy payload that is attached to multiple multirotors. The current state-of-the-art controllers either do not avoid inter-robot collision at all, leading to crashes when tasked with carrying payloads that are small in size compared to the cable lengths, or use computation

Cited by 20SourceScholar
2024

Effort Level Search in Infinite Completion Trees with Application to Task-and-Motion Planning

ICRA 2024poster

Solving a Task-and-Motion Planning (TAMP) problem can be represented as a sequential (meta-) decision process, where early decisions concern the skeleton (sequence of logic actions) and later decisions concern what to compute for such skeletons (e.g., action parameters, bounds, RRT paths, or full op…

Cited by 1SourceScholar
2024

GSRM: Building Roadmaps for Query-Efficient and Near-Optimal Path Planning Using a Reaction Diffusion System

IROS 2024poster

Mobile robots frequently navigate on roadmaps, i.e., graphs where edges represent safe motions, in applications such as healthcare, hospitality, and warehouse automation. Often the environment is quasi-static, i.e., it is sufficient to construct a roadmap once and then use it for any future planning…

Cited by 0SourceScholar
2024

Kinodynamic Motion Planning for a Team of Multirotors Transporting a Cable-Suspended Payload in Cluttered Environments

IROS 2024poster

We propose a motion planner for cable-driven payload transportation using multiple unmanned aerial vehicles (UAVs) in an environment cluttered with obstacles. Our planner is kinodynamic, i.e., it considers the full dynamics model of the transporting system including actuation constraints. Due to the…

Cited by 4SourceScholar
2024

Model AI Assignments 2024

AAAI 2024technical

The Model AI Assignments session seeks to gather and dis- seminate the best assignment designs of the Artificial In- telligence (AI) Education community. Recognizing that as- signments form the core of student learning experience, we here present abstracts of five AI assignments from the 2024 sessi…

Cited by 0SourcePDFScholar
2024

db-CBS: Discontinuity-Bounded Conflict-Based Search for Multi-Robot Kinodynamic Motion Planning

ICRA 2024poster

This paper presents a multi-robot kinodynamic motion planner that enables a team of robots with different dynamics, actuation limits, and shapes to reach their goals in challenging environments. We solve this problem by combining Conflict-Based Search (CBS), a multi-agent path finding method, and di…

Cited by 13SourcecodeScholar
2024

iDb-RRT: Sampling-based Kinodynamic Motion Planning with Motion Primitives and Trajectory Optimization

IROS 2024poster

Rapidly-exploring Random Trees (RRT) and its variations have emerged as a robust and efficient tool for finding collision-free paths in robotic systems. However, adding dynamic constraints makes the motion planning problem significantly harder, as it requires solving two-value boundary problems (com…

Cited by 5SourceScholar
2022

Sequence-of-Constraints MPC: Reactive Timing-Optimal Control of Sequential Manipulation

IROS 2022poster

Task and Motion Planning has made great progress in solving hard sequential manipulation problems. However, a gap between such planning formulations and control methods for reactive execution remains. In this paper we pro-pose a model predictive control approach dedicated to robustly execute a singl…

Cited by 27SourceScholar
2022

db-A*: Discontinuity-bounded Search for Kinodynamic Mobile Robot Motion Planning

IROS 2022poster

We consider time-optimal motion planning for dynamical systems that are translation-invariant, a property that holds for many mobile robots, such as differential-drives, cars, airplanes, and multirotors. Our key insight is that we can extend graph-search algorithms to the continuous case when used s…

Cited by 14SourcecodeScholar
2021

Neural Tree Expansion for Multi-Robot Planning in Non-Cooperative Environments

RA-L 2021

We present a self-improving, Neural Tree Expansion (NTE) method for multi-robot online planning in non-cooperative environments, where each robot attempts to maximize its cumulative reward while interacting with other self-interested robots. Our algorithm adapts the centralized, perfect information,

Cited by 14SourcecodeScholar
2020

GLAS: Global-to-Local Safe Autonomy Synthesis for Multi-Robot Motion Planning With End-to-End Learning

RA-L 2020

We present GLAS: Global-to-Local Autonomy Synthesis, a provably-safe, automated distributed policy generation for multi-robot motion planning. Our approach combines the advantage of centralized planning of avoiding local minima with the advantage of decentralized controllers of scalability and distr

Cited by 101SourcecodeScholar
2020

Neural-Swarm: Decentralized Close-Proximity Multirotor Control Using Learned Interactions

ICRA 2020poster

In this paper, we present Neural-Swarm, a nonlinear decentralized stable controller for close-proximity flight of multirotor swarms. Close-proximity control is challenging due to the complex aerodynamic interaction effects between multirotors, such as downwash from higher vehicles to lower ones. Con…

Cited by 89SourceScholar
2019

Persistent and Robust Execution of MAPF Schedules in Warehouses

RA-L 2019

Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence that can be solved quickly in practice when using simplified agent assumptions. However, real-world applications, such as warehouse automation, require physical robots to function over long time horizons without col

Cited by 132SourceScholar
2019

Sim-to-(Multi)-Real: Transfer of Low-Level Robust Control Policies to Multiple Quadrotors

IROS 2019poster

Quadrotor stabilizing controllers often require careful, model-specific tuning for safe operation. We use reinforcement learning to train policies in simulation that transfer remarkably well to multiple different physical quadrotors. Our policies are low-level, i.e., we map the rotorcrafts' state di…

Cited by 145SourceScholar
2017

Downwash-aware trajectory planning for large quadrotor teams

IROS 2017poster

We describe a method for formation-change trajectory planning for large quadrotor teams in obstacle-rich environments. Our method decomposes the planning problem into two stages: a discrete planner operating on a graph representation of the workspace, and a continuous refinement that converts the no…

Cited by 95SourceScholar
2016

Formation change for robot groups in occluded environments

IROS 2016poster

We study formation change for robot groups in known environments. We are given a team of robots partitioned into groups, where robots in the same group are interchangeable with each other. A formation specifies the locations occupied by each group. The objective is to find collision-free paths that…

Cited by 26SourceScholar