A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Filters
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks
2005
The Journal of Artificial Intelligence Research
The key technique behind this progress is the use of heuristic functions based on relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
We *prove* connections between domain structure and local search topology -- heuristic cost surface properties -- under an idealized version of the heuristic functions used in modern planners. ...
ignoring delete lists". ...
doi:10.1613/jair.1747
fatcat:hf7tghc4mva6besx4flel2ctqu
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
2011
The Journal of Artificial Intelligence Research
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. ...
In earlier work, it was observed that the optimal relaxation heuristic h+ has amazing qualities in many classical planning benchmarks, in particular pertaining to the complete absence of local minima. ...
This raises the question what h + actually is, in finite-domain variable planning, where there are no "delete lists". That question is easily answered. ...
doi:10.1613/jair.3276
fatcat:42ippsipefagxntphmjbkemozu
Everything You Always Wanted to Know about Planning
[chapter]
2011
Lecture Notes in Computer Science
Does it work? Is it interesting to do research in? Answering the latter two questions in the affirmative (of course!) ...
Working on the assumption that this "student" is you -the readers in earlier stages of their careers -I herein aim to answer three questions that you surely desired to ask back then already: What is it ...
I am grateful to all my colleagues from the planning community, and I thank them specifically for their work as described and cited herein. I hope we'll still be friends after you read this. ...
doi:10.1007/978-3-642-24455-1_1
fatcat:ld5ob7teurbdpbzq3dko7bbik4
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
2005
The Journal of Artificial Intelligence Research
Our results indicate a large reduction in search effort in those complex domains where structural information can be inferred. ...
Despite recent progress in AI planning, many benchmarks remain challenging for current planners. ...
As shown before, FF computes this heuristic by solving a relaxed planning problem (i.e., the delete effects of actions are ignored) in a graphplan framework. ...
doi:10.1613/jair.1696
fatcat:cjqaezl67vajnicunmyianyjp4
Abstracts of Working Papers in Economics
1997
Abstracts of Working Papers in Economics
AB This paper explores the relationship between technology and the policies that govern competition in the local telephone business. ...
underlying network technology such as network backbone and its topology. ...
In this step the constraints arising from incentives are ignored. ...
doi:10.1017/s0951007900003508
fatcat:sjk3leigpvgdfeuxuh5dsgiuaa
Abstracts of Working Papers in Economics
1990
Abstracts of Working Papers in Economics
The simplex method for solving linear programs can be interpreted as a search for market prices that equilibrate the demand for factors of production with their supply. ...
AB We argue that the rapid growth in inventive activity during early American industrialization was characterized by a disproportionate increase in the involvement of segments of the population with relatively ...
delete. ...
doi:10.1017/s0951007900001777
fatcat:xbi4wofvazbhnnpitysz5ojzxi
Generalizing the Relaxed Planning Heuristic to Non-linear Tasks
[chapter]
2004
Lecture Notes in Computer Science
The relaxed planning heuristic is a prominent state-to-goal estimator function for domain-independent forward-chaining heuristic search and local search planning. ...
While current domain description languages allow general arithmetic expressions in precondition and effect lists, the heuristic has been devised for propositional, restricted, and linear tasks only. ...
The relaxation of an operator a = (pre(a), add(a), del (a)) is the tripel (pre(a), add(a), ∅), so that the delete list is ignored. ...
doi:10.1007/978-3-540-30221-6_16
fatcat:yp2sefbfa5c7lnn656xcgh7ht4
Abstracts of Working Papers in Economics
1994
Abstracts of Working Papers in Economics
AB Increasing urban and environmental demands for water have led to widespread calls for reform of the existing water allocation system in California. ...
In this paper we advance a new framework for noncooperative, multilateral bargaining that can be used to conceptualize the negotiation process. ...
Known biotechnology of cattle demographics imply sharp numerical benchmarks for the dynamic system mat describes the evolution of cattle stocks and beef consumption. ...
doi:10.1017/s0951007900004149
fatcat:enpbondewbgibkktwlz63dd6lm
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
2006
The Journal of Artificial Intelligence Research
Based on the strong locality of mutex constraints observed in many benchmarks of the Fourth International Planning Competition (IPC4), we propose to partition the constraints of a planning problem into ...
We present a partition-and-resolve strategy that looks for locally optimal subplans in constraint-partitioned temporal planning subproblems and that resolves those inconsistent global constraints across ...
Acknowledgments The research in this paper is supported by National Science Foundation Grant IIS 03-12084. ...
doi:10.1613/jair.1918
fatcat:3q43wlthina7jbmnwakss6vwcm
Abstracts of Working Papers in Economics
1994
Abstracts of Working Papers in Economics
AB In this paper we attempt to unify some recent work on equilibrium refinements in signaling games by examining procedures which delete strategies that are dominated relative to some reference payoffs ...
We then ask whether the strategy of choosing the sure payoff survives iterative deletion of dominated strategies. ...
The proof and the ensuing discussion make clear the role of local compactness in determining the crucial properties of the topology of vague convergence. ...
doi:10.1017/s095100790000406x
fatcat:yeczqgu23rfejdmwrke6csvgby
Abstracts of Working Papers in Economics
1990
Abstracts of Working Papers in Economics
and disturbances in a rational expectation dynamic general equilibrium simulation model of the work economy, and applies the analysis to the study of the European Monetary system. ...
AB In recent years a number of structural changes in the international oil market have taken place, including the increasing importance of the spot market vis-a-vis OPEC in determining oil prices. ...
Search Theory. AB This paper examines equilibrium in a market with free entry where consumers search and firms set prices on individual units of the commodity. ...
doi:10.1017/s0951007900001613
fatcat:5qfw3qyg75gjtb2qwmceqprqsi
5G PPP Architecture Working Group - View on 5G Architecture, Version 3.0
2019
Zenodo
The results of the Working Group are now captured in this Version 3.0, which presents the consolidated European view on the architecture design. ...
The work has continued with the 5G PPP Phase II and Phase III projects with special focus on understanding the requirements from vertical industries involved in the projects and then driving the required ...
The work of ENI has been planned until 2021. ...
doi:10.5281/zenodo.3265030
fatcat:ctlelszvm5fdfodlequre424wa
Abstracts of Working Papers in Economics
1989
Abstracts of Working Papers in Economics
This section contains abstracts and complete bibliographic information for current working papers, listed alphabetically by primary author. ...
, and (2) the variance in the percentage change in consumption is a monotone function of the age of the cohort. ...
TI Federal Deducibility and Local ...
doi:10.1017/s0951007900001133
fatcat:gece2r4j5bfwfhihguvkkuovga
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
2006
The Journal of Artificial Intelligence Research
In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). ...
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. ...
the delete lists. ...
doi:10.1613/jair.1982
fatcat:hmne5ycxj5gjtn5d2u5hz73dqu
Autonomous Exploration and Map Construction of a Mobile Robot Based on the TGHM Algorithm
2020
Sensors
Simulations and experiments were performed to benchmark the proposed algorithm in robot autonomous exploration and map construction. ...
The TGHM is a fusion of a topology map, containing the information gain and motion cost for exploration, and a grid map, representing the established map for navigation and localization. ...
Previous Work on Exploration The equipment required for accomplishing a robot exploration task is listed as the following [18]:
1. ...
doi:10.3390/s20020490
pmid:31952240
pmcid:PMC7013441
fatcat:serbsd6vbfhfxbuhexl3bk6emu
« Previous
Showing results 1 — 15 out of 1,995 results