Folgen
Michael Otte
Michael Otte
Bestätigte E-Mail-Adresse bei umd.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
RRTX: Asymptotically optimal single-query sampling-based motion planning with quick replanning
M Otte, E Frazzoli
The International Journal of Robotics Research 35 (7), 797-822, 2016
2442016
Auctions for multi-robot task allocation in communication limited environments
M Otte, MJ Kuhlman, D Sofge
Autonomous Robots 44, 547-584, 2020
1382020
: Real-Time Motion Planning/Replanning for Environments with Unpredictable Obstacles
M Otte, E Frazzoli
Algorithmic foundations of robotics XI: selected contributions of the …, 2015
1352015
C-FOREST: Parallel shortest path planning with superlinear speedup
M Otte, N Correll
IEEE Transactions on Robotics 29 (3), 798-806, 2013
1062013
Efficient collision checking in sampling-based motion planning via safety certificates
J Bialkowski, M Otte, S Karaman, E Frazzoli
The International Journal of Robotics Research 35 (7), 767-796, 2016
622016
Efficient collision checking in sampling-based motion planning
J Bialkowski, S Karaman, M Otte, E Frazzoli
Algorithmic Foundations of Robotics X: Proceedings of the Tenth Workshop on …, 2013
602013
A survey of machine learning approaches to robotic path-planning
MW Otte
University of Colorado at Boulder, 2015
562015
Decentralized task allocation in multi-agent systems using a decentralized genetic algorithm
R Patel, E Rudnick-Cohen, S Azarm, M Otte, H Xu, JW Herrmann
2020 IEEE International Conference on Robotics and Automation (ICRA), 3770-3776, 2020
482020
LSwarm: Efficient collision avoidance for large swarms with coverage constraints in complex urban scenes
SH Arul, AJ Sathyamoorthy, S Patel, M Otte, H Xu, MC Lin, D Manocha
IEEE Robotics and Automation Letters 4 (4), 3940-3947, 2019
412019
Free-configuration biased sampling for motion planning
J Bialkowski, M Otte, E Frazzoli
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2013
372013
Any-time path-planning: Time-varying wind field+ moving obstacles
M Otte, W Silva, E Frew
2016 IEEE international conference on robotics and automation (ICRA), 2575-2582, 2016
362016
Multi-robot task allocation with auctions in harsh communication environments
M Otte, M Kuhlman, D Sofge
2017 international symposium on multi-robot and multi-agent systems (MRS), 32-39, 2017
342017
Experimental comparison of decentralized task allocation algorithms under imperfect communication
S Nayak, S Yeotikar, E Carrillo, E Rudnick-Cohen, MKM Jaffar, R Patel, ...
IEEE Robotics and Automation Letters 5 (2), 572-579, 2020
332020
Game theoretic controller synthesis for multi-robot motion planning Part I: Trajectory based algorithms
M Zhu, M Otte, P Chaudhari, E Frazzoli
2014 IEEE International Conference on Robotics and Automation (ICRA), 1646-1651, 2014
292014
Any-com multi-robot path-planning: Maximizing collaboration for variable bandwidth
M Otte, N Correll
Distributed Autonomous Robotic Systems: The 10th International Symposium …, 2013
272013
Local path planning in image space for autonomous robot navigation in unstructured environments
MW Otte, SG Richardson, J Mulligan, G Grudic
2007 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2007
262007
Communication-aware multi-agent metareasoning for decentralized task allocation
E Carrillo, S Yeotikar, S Nayak, MKM Jaffar, S Azarm, JW Herrmann, ...
IEEE Access 9, 98712-98730, 2021
252021
Any-com multi-robot path-planning with dynamic teams: Multi-robot coordination under communication constraints
M Otte, N Correll
Experimental Robotics: The 12th International Symposium on Experimental …, 2014
232014
Path planning in image space for autonomous robot navigation in unstructured environments
MW Otte, SG Richardson, J Mulligan, G Grudic
Journal of Field Robotics 26 (2), 212-240, 2009
222009
Online learning of multiple perceptual models for navigation in unknown terrain
G Grudic, J Mulligan, M Otte, A Bates
Field and Service Robotics: Results of the 6th International Conference, 411-420, 2008
212008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20