User profiles for Wolfgang Hönig
Wolfgang HönigAssistant Professor, Technical University Berlin Verified email at tu-berlin.de Cited by 3043 |
Trajectory planning for quadrotor swarms
We describe a method for multirobot trajectory planning in known, obstacle-rich environments.
We demonstrate our approach on a quadrotor swarm navigating in a warehouse setting. …
We demonstrate our approach on a quadrotor swarm navigating in a warehouse setting. …
Crazyswarm: A large nano-quadcopter swarm
We define a system architecture for a large swarm of miniature quadcopters flying in dense
formation indoors. The large number of small vehicles motivates novel design choices for …
formation indoors. The large number of small vehicles motivates novel design choices for …
Multi-agent path finding with kinematic constraints
Multi-Agent Path Finding (MAPF) is well studied in both AI and robotics. Given a discretized
environment and agents with assigned start and goal locations, MAPF solvers from AI find …
environment and agents with assigned start and goal locations, MAPF solvers from AI find …
Overview: Generalizations of multi-agent path finding to real-world scenarios
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical
computer science and operations research. We discuss issues that arise when generalizing …
computer science and operations research. We discuss issues that arise when generalizing …
Neural-swarm2: Planning and control of heterogeneous multirotor swarms using learned interactions
We present Neural-Swarm2 , a learning-based method for motion planning and control that
allows heterogeneous multirotors in a swarm to safely fly in close proximity. Such operation …
allows heterogeneous multirotors in a swarm to safely fly in close proximity. Such operation …
Downwash-aware trajectory planning for large quadrotor teams
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: …
obstacle-rich environments. Our method decomposes the planning problem into two stages: …
PIConGPU: a fully relativistic particle-in-cell code for a GPU cluster
H Burau, R Widera, W Hönig… - … on Plasma Science, 2010 - ieeexplore.ieee.org
The particle-in-cell (PIC) algorithm is one of the most widely used algorithms in computational
plasma physics. With the advent of graphical processing units (GPUs), large-scale plasma …
plasma physics. With the advent of graphical processing units (GPUs), large-scale plasma …
Conflict-based search with optimal task assignment
We consider a variant of the Multi-Agent Path-Finding problem that seeks both task assignments
and collision-free paths for a set of agents navigating on a graph, while minimizing the …
and collision-free paths for a set of agents navigating on a graph, while minimizing the …
Overview: A hierarchical framework for plan generation and execution in multirobot systems
The authors present an overview of a hierarchical framework for coordinating task- and
motion-level operations in multirobot systems. Their framework is based on the idea of using …
motion-level operations in multirobot systems. Their framework is based on the idea of using …
Persistent and robust execution of MAPF schedules in warehouses
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 …
be solved quickly in practice when using simplified agent assumptions. However, real-world …