default search action
Moritz Niendorf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c8]Stefano Pini, Christian S. Perone, Aayush Ahuja, Ana Sofia Rufino Ferreira, Moritz Niendorf, Sergey Zagoruyko:
Safe Real-World Autonomous Driving by Learning to Predict and Plan with a Mixture of Experts. ICRA 2023: 10069-10075 - 2022
- [c7]Matt Vitelli, Yan Chang, Yawei Ye, Ana Ferreira, Maciej Wolczyk, Blazej Osinski, Moritz Niendorf, Hugo Grimmett, Qiangui Huang, Ashesh Jain, Peter Ondruska:
SafetyNet: Safe Planning for Real-World Self-Driving Vehicles Using Machine-Learned Policies. ICRA 2022: 897-904 - [i2]Stefano Pini, Christian S. Perone, Aayush Ahuja, Ana Sofia Rufino Ferreira, Moritz Niendorf, Sergey Zagoruyko:
Safe Real-World Autonomous Driving by Learning to Predict and Plan with a Mixture of Experts. CoRR abs/2211.02131 (2022) - 2021
- [i1]Matt Vitelli, Yan Chang, Yawei Ye, Maciej Wolczyk, Blazej Osinski, Moritz Niendorf, Hugo Grimmett, Qiangui Huang, Ashesh Jain, Peter Ondruska:
SafetyNet: Safe planning for real-world self-driving vehicles using machine-learned policies. CoRR abs/2109.13602 (2021)
2010 – 2019
- 2018
- [j5]Moritz Niendorf, Anouck R. Girard:
Exact and Approximate Stability of Solutions to Traveling Salesman Problems. IEEE Trans. Cybern. 48(2): 583-595 (2018) - 2016
- [j4]Jonathan C. Las Fargeas, Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Stability and Criticality Analysis for Integer Linear Programs With Markovian Problem Data. IEEE Trans. Autom. Control. 61(6): 1466-1476 (2016) - [j3]Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Stability of Solutions to Classes of Traveling Salesman Problems. IEEE Trans. Cybern. 46(4): 973-985 (2016) - [j2]Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Stability Analysis of Runway Schedules. IEEE Trans. Intell. Transp. Syst. 17(12): 3380-3390 (2016) - [c6]Moritz Niendorf, Anouck R. Girard:
Robustness of communication links for teams of unmanned aircraft by sensitivity analysis of minimum spanning trees. ACC 2016: 4623-4629 - 2015
- [c5]Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Stability analysis of optimal runway schedules. ACC 2015: 4616-4621 - [c4]Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Stability analysis of multi-objective planning problems for unmanned aircraft. CDC 2015: 7238-7243 - 2014
- [j1]Arne Altmann, Moritz Niendorf, Marius Bednar, Reinhard Reichel:
Improved 3D Interpolation-Based Path Planning for a Fixed-Wing Unmanned Aircraft. J. Intell. Robotic Syst. 76(1): 185-197 (2014) - [c3]Moritz Niendorf, Pierre T. Kabamba, Anouck R. Girard:
Polynomial time sensitivity analysis of task schedules. ACC 2014: 4593-4598 - [c2]Moritz Niendorf, Jonathan C. Las Fargeas, Pierre T. Kabamba, Anouck R. Girard:
Stability analysis of stochastic integer optimization problems. CDC 2014: 402-407 - 2012
- [c1]Moritz Niendorf, Florian Adolf, Tjorven Gerhard:
Behavior-Based Onboard Mission Management for an Unmanned Fixed-Wing Aircraft. Infotech@Aerospace 2012
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-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint