نتایج جستجو برای: how planners

تعداد نتایج: 975296  

2005
Ethan D. Bolker Yiping Ding Ken Hu

The history of computing is a history of virtualization. Each increase in the number of abstraction layers separating the end user from the hardware makes life easier for the user but harder for the system capacity planner who must understand the relationship between logical and physical configurations to guarantee performance. In this paper we discuss possible architectures for virtual systems...

2008
Stephan Winter Yunhui Wu

How far are current route planners from imitating humans in giving route directions? And what can we learn, in terms of gaps of knowledge and need for further research, from this question?

2000
Donald G. Hodges James T. Gunter Christopher M. Swalm James L. Regens

This study illustrates how remotely-sensed data and GIS can be utilized to allow planners to evaluate the relationship between land use, environmental protection policies, and resource availability. The case study examines St. Tammany Parish in Louisiana which has experienced tremendous population growth and land use change in the past two decades. To date, work has been completed on developing...

2017
Louise A. Dennis Mateja Jamnik Martin Pollet

We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, λCLaM, Ωmega and IsaPlanner, and demonstrate how the framework allow...

2011
Matthew Crosby Michael Rovatsos

The focus of multiagent planning research has recently turned towards domains with self-interested agents leading to the definition of Coalition–Planning Games (CoPGs). In this paper, we investigate algorithms for solving a restricted class of “safe” CoPGs, in which no agent can benefit from making another agent’s plan invalid. We introduce a novel, generalised solution concept, and show how pr...

2005
Louise A. Dennis Mateja Jamnik Martin Pollet Alan Bundy

We present a framework for describing proof planners. This framework is based around a decomposition of proof planners into planning states, proof language, proof plans, proof methods, proof revision, proof control and planning algorithms. We use this framework to motivate the comparison of three recent proof planning systems, λCLaM, Ωmega and IsaPlanner, and demonstrate how the framework allow...

2006
Robert P. Goldman

This paper provides techniques for hierarchical task network (HTN) planning with durative actions. HTNs can provide useful heuristic guidance to planners, express goals that cannot be expressed in simple first principles planners, and allow plan generation to be limited by external constraints. The decomposition information in HTN plans can also help guide plan execution. This paper provides a ...

1997
Christopher G. Atkeson

This paper describes some of the interactions of model learning algorithms and planning algorithms we have found in exploring model-based reinforcement learning. The paper focuses on how local trajectory optimizers can be used effectively with learned nonparametric models. We find that trajectory planners that are fully consistent with the learned model often have difficulty finding reasonable ...

2000
Donald G. Hodges James T. Gunter Christopher M. Swalm James L. Regens

This study illustrates how remotely-sensed data and GIS can be utilized to allow planners to evaluate the relationship between land use, environmental protection policies, and resource availability. The case study examines St. Tammany Parish in Louisiana which has experienced tremendous population growth and land use change in the past two decades. To date, work has been completed on developing...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید