Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dominik Off

dblp:47/8370 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 91% Robot navigation and mapping · 9%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
hierarchical planning
0.112010
HTN robot planning in partially observable dynamic environments · ICRA 2010
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
partially observable planning
0.112010
HTN robot planning in partially observable dynamic environments · ICRA 2010
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty
0.112010
HTN robot planning in partially observable dynamic environments · ICRA 2010
Robotics › Robot navigation and mapping
mobile service robot
0.012010
HTN robot planning in partially observable dynamic environments · ICRA 2010

Methods — techniques the papers use, named apart from their topics

hierarchical task networks · 0.1deliberative planning · 0.1
YearPublicationVenuePosition
2012 Continual HTN Planning and Acting in Open-ended Domains - Considering Knowledge Acquisition Opportunities
Dominik Off, Jianwei Zhang 0001
ICAART (1)1
2010 HTN robot planning in partially observable dynamic environments
abstract
Experiments showed that Hierarchical Task Network (HTN) planners are suitable to find solutions for nontrivial tasks in complex scenarios. Mobile service robots are able to execute actions which may constitute the basic building blocks to achieve high-level goals. However, only few experiments demonstrate the application of a general purpose deliberative planner in the domain of mobile service robots. One challenging problem arises from the fact that adaptive AI-based planners presume the closed-world assumption (CWA) and are therefore unable to deal with incomplete information. Unknown objects which are not represented in the planning domain, for example, cannot be integrated into the planning process. Since mobile service robots act in a real dynamic environment and construct or adapt their world model autonomously based on sensory data, they are inevitably confronted with uncertain and incomplete information about the world. This conflict between simplified assumptions for planning on the one hand and the complexity of the real world on the other constitutes a major problem of modern robotics. This paper describes two approaches to dealing with incomplete world knowledge in the context of HTN robot planning. Several experiments demonstrate that the approaches can successfully be applied in a dynamic and unstructured environment.
Martin Weser, Dominik Off, Jianwei Zhang 0001
ICRA2