default search action
Andreas Orthey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Andreas Orthey, Constantinos Chamzas, Lydia E. Kavraki:
Sampling-Based Motion Planning: A Comparative Review. Annu. Rev. Control. Robotics Auton. Syst. 7(1) (2024) - [j8]Andreas Orthey, Sohaib Akbar, Marc Toussaint:
Multilevel motion planning: A fiber bundle formulation. Int. J. Robotics Res. 43(1): 3-33 (2024) - 2023
- [j7]Servet B. Bayraktar, Andreas Orthey, Zachary K. Kingston, Marc Toussaint, Lydia E. Kavraki:
Solving Rearrangement Puzzles Using Path Defragmentation in Factored State Spaces. IEEE Robotics Autom. Lett. 8(8): 4529-4536 (2023) - [j6]Valentin N. Hartmann, Andreas Orthey, Danny Driess, Ozgur S. Oguz, Marc Toussaint:
Long-Horizon Multi-Robot Rearrangement Planning for Construction Assembly. IEEE Trans. Robotics 39(1): 239-252 (2023) - [i20]Andrey Solano, Arne Sieverling, Robert Gieselmann, Andreas Orthey:
Fast-dRRT*: Efficient Multi-Robot Motion Planning for Automated Industrial Manufacturing. CoRR abs/2309.10665 (2023) - [i19]Janis Eric Freund, Camille Phiquepal, Andreas Orthey, Marc Toussaint:
Asymptotically Optimal Belief Space Planning in Discrete Partially-Observable Domains. CoRR abs/2309.10672 (2023) - [i18]Andreas Orthey, Constantinos Chamzas, Lydia E. Kavraki:
Sampling-Based Motion Planning: A Comparative Review. CoRR abs/2309.13119 (2023) - 2022
- [j5]Constantinos Chamzas, Carlos Quintero-Peña, Zachary K. Kingston, Andreas Orthey, Daniel Rakita, Michael Gleicher, Marc Toussaint, Lydia E. Kavraki:
MotionBenchMaker: A Tool to Generate and Benchmark Motion Planning Datasets. IEEE Robotics Autom. Lett. 7(2): 882-889 (2022) - [j4]Camille Phiquepal, Andreas Orthey, Nicolas Viennot, Marc Toussaint:
Path-Tree Optimization in Discrete Partially Observable Environments Using Rapidly-Exploring Belief-Space Graphs. IEEE Robotics Autom. Lett. 7(4): 10160-10167 (2022) - [c11]Francesco Grothe, Valentin N. Hartmann, Andreas Orthey, Marc Toussaint:
ST-RRT*: Asymptotically-Optimal Bidirectional Motion Planning through Space-Time. ICRA 2022: 3314-3320 - [c10]Jay Kamat, Joaquim Ortiz de Haro, Marc Toussaint, Florian T. Pokorny, Andreas Orthey:
BITKOMO: Combining Sampling and Optimization for Fast Convergence in Optimal Motion Planning. IROS 2022: 4492-4497 - [i17]Jay Kamat, Joaquim Ortiz de Haro, Marc Toussaint, Florian T. Pokorny, Andreas Orthey:
BITKOMO: Combining Sampling and Optimization for Fast Convergence in Optimal Motion Planning. CoRR abs/2203.01751 (2022) - [i16]Francesco Grothe, Valentin N. Hartmann, Andreas Orthey, Marc Toussaint:
ST-RRT*: Asymptotically-Optimal Bidirectional Motion Planning through Space-Time. CoRR abs/2203.02176 (2022) - [i15]Camille Phiquepal, Andreas Orthey, Nicolas Viennot, Marc Toussaint:
Path-Tree Optimization in Partially Observable Environments using Rapidly-Exploring Belief-Space Graphs. CoRR abs/2204.04444 (2022) - [i14]Ilyes Toumi, Andreas Orthey, Alexander von Rohr, Ngo Anh Vien:
Multi-Arm Bin-Picking in Real-Time: A Combined Task and Motion Planning Approach. CoRR abs/2211.11089 (2022) - [i13]S. Bora Bayraktar, Andreas Orthey, Zachary K. Kingston, Marc Toussaint, Lydia E. Kavraki:
Solving Rearrangement Puzzles using Path Defragmentation in Factored State Spaces. CoRR abs/2212.02955 (2022) - 2021
- [j3]Andreas Orthey, Marc Toussaint:
Section Patterns: Efficiently Solving Narrow Passage Problems in Multilevel Motion Planning. IEEE Trans. Robotics 37(6): 1891-1905 (2021) - [c9]Marie-Therese Khoury, Andreas Orthey, Marc Toussaint:
Efficient Sampling of Transition Constraints for Motion Planning under Sliding Contacts. CASE 2021: 1547-1553 - [c8]Andreas Orthey, Marc Toussaint:
Sparse Multilevel Roadmaps for High-Dimensional Robotic Motion Planning. ICRA 2021: 7851-7857 - [c7]Andreas Orthey, Marc Toussaint:
Visualizing Local Minima in Multi-robot Motion Planning Using Multilevel Morse Theory. WAFR 2021: 502-517 - [i12]Valentin Noah Hartmann, Andreas Orthey, Danny Driess, Ozgur S. Oguz, Marc Toussaint:
Long-Horizon Multi-Robot Rearrangement Planning for Construction Assembly. CoRR abs/2106.02489 (2021) - [i11]Andreas Orthey, Florian T. Pokorny, Marc Toussaint:
Approximate Topological Optimization using Multi-Mode Estimation for Robot Motion Planning. CoRR abs/2107.02498 (2021) - [i10]Constantinos Chamzas, Carlos Quintero-Peña, Zachary K. Kingston, Andreas Orthey, Daniel Rakita, Michael Gleicher, Marc Toussaint, Lydia E. Kavraki:
MotionBenchMaker: A Tool to Generate and Benchmark Motion Planning Datasets. CoRR abs/2112.06402 (2021) - 2020
- [j2]Andreas Orthey, Benjamin Frész, Marc Toussaint:
Motion Planning Explorer: Visualizing Local Minima Using a Local-Minima Tree. IEEE Robotics Autom. Lett. 5(2): 346-353 (2020) - [i9]Andreas Orthey, Marc Toussaint:
Visualizing Local Minima in Multi-Robot Motion Planning using Morse Theory. CoRR abs/2002.04385 (2020) - [i8]Andreas Orthey, Sohaib Akbar, Marc Toussaint:
Multilevel Motion Planning: A Fiber Bundle Formulation. CoRR abs/2007.09435 (2020) - [i7]Andreas Orthey, Marc Toussaint:
Section Patterns: Efficiently Solving Narrow Passage Problems using Multilevel Motion Planning. CoRR abs/2010.14524 (2020) - [i6]Andreas Orthey, Marc Toussaint:
Sparse Multilevel Roadmaps on Fiber Bundles for High-Dimensional Motion Planning. CoRR abs/2011.00832 (2020) - [i5]Marie-Therese Khoury, Andreas Orthey, Marc Toussaint:
Efficient Sampling of Transition Constraints for Motion Planning under Sliding Contacts. CoRR abs/2011.01552 (2020)
2010 – 2019
- 2019
- [c6]Andreas Orthey, Marc Toussaint:
Rapidly-Exploring Quotient-Space Trees: Motion Planning Using Sequential Simplifications. ISRR 2019: 52-68 - [i4]Andreas Orthey, Marc Toussaint:
Rapidly-Exploring Quotient-Space Trees: Motion Planning using Sequential Simplifications. CoRR abs/1906.01350 (2019) - [i3]Andreas Orthey, Benjamin Frész, Marc Toussaint:
Motion Planning Explorer: Visualizing Local Minima using a Local-Minima Tree. CoRR abs/1909.05035 (2019) - 2018
- [j1]Andreas Orthey, Olivier Roussel, Olivier Stasse, Michel Taïx:
Motion planning in Irreducible Path Spaces. Robotics Auton. Syst. 109: 97-108 (2018) - [c5]Andreas Orthey, Adrien Escande, Eiichi Yoshida:
Quotient-Space Motion Planning. IROS 2018: 8089-8096 - [i2]Andreas Orthey, Adrien Escande, Eiichi Yoshida:
Quotient-Space Motion Planning. CoRR abs/1807.09468 (2018) - [i1]Andreas Orthey, Olivier Roussel, Olivier Stasse, Michel Taïx:
Motion Planning in Irreducible Path Spaces. CoRR abs/1809.05322 (2018) - 2015
- [b1]Andreas Orthey:
Exploiting structure in humanoid motion planning. (Exploiter la structure pour la planification de mouvement humanoïde). National Polytechnic Institute of Toulouse, France, 2015 - [c4]Andreas Orthey, Olivier Stasse, Florent Lamiraux:
Motion planning and irreducible trajectories. ICRA 2015: 3576-3581 - 2013
- [c3]Andreas Orthey, Olivier Stasse:
Towards reactive whole-body motion planning in cluttered environments by precomputing feasible motion spaces. Humanoids 2013: 274-279 - [c2]Andreas Orthey, Marc Toussaint, Nikolay Jetchev:
Optimizing motion primitives to make symbolic models more predictive. ICRA 2013: 2868-2873 - 2010
- [c1]Dov Katz, Andreas Orthey, Oliver Brock:
Interactive Perception of Articulated Objects. ISER 2010: 301-315
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint