default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoaquim Ortiz de Haro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Akmaral Moldagalieva, Joaquim Ortiz de Haro, Marc Toussaint, Wolfgang Hönig:
db-CBS: Discontinuity-Bounded Conflict-Based Search for Multi-Robot Kinodynamic Motion Planning. ICRA 2024: 14569-14575- [c10]Marc Toussaint, Joaquim Ortiz de Haro, Valentin N. Hartmann, Erez Karpas, Wolfgang Hönig:
Effort Level Search in Infinite Completion Trees with Application to Task-and-Motion Planning. ICRA 2024: 14902-14908 - [c9]Svetlana Levit, Joaquim Ortiz de Haro, Marc Toussaint:
Solving Sequential Manipulation Puzzles by Finding Easier Subproblems. ICRA 2024: 14924-14930 - [i16]Joaquim Ortiz de Haro, Wolfgang Hönig, Valentin N. Hartmann, Marc Toussaint, Ludovic Righetti:
iDb-RRT: Sampling-based Kinodynamic Motion Planning with Motion Primitives and Trajectory Optimization. CoRR abs/2403.10745 (2024) - [i15]Joaquim Ortiz de Haro:
Factored Task and Motion Planning with Combined Optimization, Sampling and Learning. CoRR abs/2404.03567 (2024) - [i14]Svetlana Levit, Joaquim Ortiz de Haro, Marc Toussaint:
Solving Sequential Manipulation Puzzles by Finding Easier Subproblems. CoRR abs/2405.02053 (2024) - [i13]Marc Toussaint, Cornelius V. Braun, Joaquim Ortiz de Haro:
NLP Sampling: Combining MCMC and NLP Methods for Diverse Constrained Sampling. CoRR abs/2407.03035 (2024) - 2023
- [c8]Joaquim Ortiz de Haro, Jung-Su Ha, Danny Driess, Erez Karpas, Marc Toussaint
:
Learning Feasibility of Factored Nonlinear Programs in Robotic Manipulation Planning. ICRA 2023: 3729-3735 - [c7]Valentin N. Hartmann, Joaquim Ortiz de Haro, Marc Toussaint:
Efficient Path Planning In Manipulation Planning Problems by Actively Reusing Validation Effort. IROS 2023: 2822-2829 - [i12]Valentin N. Hartmann, Joaquim Ortiz de Haro, Marc Toussaint:
Efficient Path Planning In Manipulation Planning Problems by Actively Reusing Validation Effort. CoRR abs/2303.00637 (2023) - [i11]Welf Rehberg, Joaquim Ortiz de Haro, Marc Toussaint, Wolfgang Hönig:
Comparison of Optimization-Based Methods for Energy-Optimal Quadrotor Motion Planning. CoRR abs/2304.14062 (2023) - [i10]Phillip Grote, Joaquim Ortiz de Haro, Marc Toussaint, Ozgur S. Oguz:
Neural Field Representations of Articulated Objects for Robotic Manipulation Planning. CoRR abs/2309.07620 (2023) - [i9]Akmaral Moldagalieva, Joaquim Ortiz de Haro, Marc Toussaint, Wolfgang Hönig:
db-CBS: Discontinuity-Bounded Conflict-Based Search for Multi-Robot Kinodynamic Motion Planning. CoRR abs/2309.16445 (2023) - [i8]Khaled Wahba, Joaquim Ortiz de Haro, Marc Toussaint, Wolfgang Hönig:
Kinodynamic Motion Planning for a Team of Multirotors Transporting a Cable-Suspended Payload in Cluttered Environments. CoRR abs/2310.03394 (2023) - [i7]Joaquim Ortiz de Haro, Wolfgang Hönig, Valentin N. Hartmann, Marc Toussaint:
iDb-A*: Iterative Search and Optimization for Optimal Kinodynamic Motion Planning. CoRR abs/2311.03553 (2023) - 2022
- [j1]Joaquim Ortiz de Haro, Erez Karpas, Michael Katz, Marc Toussaint:
A Conflict-Driven Interface Between Symbolic Planning and Nonlinear Constraint Solving. IEEE Robotics Autom. Lett. 7(4): 10518-10525 (2022) - [c6]Joaquim Ortiz de Haro, Erez Karpas, Marc Toussaint, Michael Katz:
Conflict-Directed Diverse Planning for Logic-Geometric Programming. ICAPS 2022: 279-287 - [c5]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 - [c4]Wolfgang Hönig, Joaquim Ortiz de Haro, Marc Toussaint:
db-A*: Discontinuity-bounded Search for Kinodynamic Mobile Robot Motion Planning. IROS 2022: 13540-13547 - [c3]Cornelius V. Braun, Joaquim Ortiz de Haro, Marc Toussaint, Ozgur S. Oguz:
RHH-LGP: Receding Horizon And Heuristics-Based Logic-Geometric Programming For Task And Motion Planning. IROS 2022: 13761-13768 - [i6]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) - [i5]Wolfgang Hönig, Joaquim Ortiz de Haro, Marc Toussaint:
db-A*: Discontinuity-bounded Search for Kinodynamic Mobile Robot Motion Planning. CoRR abs/2203.11108 (2022) - [i4]Joaquim Ortiz de Haro, Jung-Su Ha, Danny Driess, Erez Karpas, Marc Toussaint:
Learning Feasibility of Factored Nonlinear Programs in Robotic Manipulation Planning. CoRR abs/2210.12386 (2022) - [i3]Joaquim Ortiz de Haro, Erez Karpas, Michael Katz, Marc Toussaint:
A Conflict-driven Interface between Symbolic Planning and Nonlinear Constraint Solving. CoRR abs/2211.15275 (2022) - 2021
- [c2]Joaquim Ortiz de Haro, Jung-Su Ha, Danny Driess, Marc Toussaint:
Structured deep generative models for sampling on constraint manifolds in sequential manipulation. CoRL 2021: 213-223 - [c1]Joaquim Ortiz de Haro, Valentin N. Hartmann, Ozgur S. Oguz, Marc Toussaint:
Learning Efficient Constraint Graph Sampling for Robotic Sequential Manipulation. ICRA 2021: 4606-4612 - [i2]Cornelius V. Braun, Joaquim Ortiz de Haro, Marc Toussaint, Ozgur S. Oguz:
RHH-LGP: Receding Horizon And Heuristics-Based Logic-Geometric Programming For Task And Motion Planning. CoRR abs/2110.03420 (2021) - 2020
- [i1]Joaquim Ortiz de Haro, Valentin N. Hartmann, Ozgur S. Oguz, Marc Toussaint:
Learning Efficient Constraint Graph Sampling for Robotic Sequential Manipulation. CoRR abs/2011.04828 (2020)
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-20 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
