scholarly journals Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems

Silva Fennica ◽  
2002 ◽  
Vol 36 (2) ◽  
Author(s):  
Pete Bettinger ◽  
David Graetz ◽  
Kevin Boston ◽  
John Sessions ◽  
Woodam Chung
Keyword(s):  
Planning Techniques ◽  
Planning Problems ◽  
Wildlife Planning

scholarly journals Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning

2019 ◽  
Vol 33 ◽  
pp. 7520-7529 ◽  
Author(s):  
Gregor Behnke ◽  
Daniel Höller ◽  
Susanne Biundo
Keyword(s):  
Partial Order ◽  
Propositional Logic ◽  
State Of The Art ◽  
Partial Ordering ◽  
Compact Representation ◽  
Planning Techniques ◽  
Model Complex ◽  
Htn Planning ◽  
Sat Solver ◽  
Planning Problems

HTN planning provides an expressive formalism to model complex application domains. It has been widely used in realworld applications. However, the development of domainindependent planning techniques for such models is still lacking behind. The need to be informed about both statetransitions and the task hierarchy makes the realisation of search-based approaches difficult, especially with unrestricted partial ordering of tasks in HTN domains. Recently, a translation of HTN planning problems into propositional logic has shown promising empirical results. Such planners benefit from a unified representation of state and hierarchy, but until now require very large formulae to represent partial order. In this paper, we introduce a novel encoding of HTN Planning as SAT. In contrast to related work, most of the reasoning on ordering relations is not left to the SAT solver, but done beforehand. This results in much smaller formulae and, as shown in our evaluation, in a planner that outperforms previous SAT-based approaches as well as the state-of-the-art in search-based HTN planning.

scholarly journals Learning from Italian Typology- and Morphology-Led Planning Techniques: A Planning Framework for Yingping, Xiamen

2019 ◽  
Vol 11 (7) ◽  
pp. 1842 ◽  
Author(s):  
Shuyi Xie
Keyword(s):  
Large Scale ◽  
Urban Landscape ◽  
Structural Elements ◽  
City Center ◽  
Planning Techniques ◽  
Urban Fabric ◽  
Planning Framework ◽  
Planning Scheme ◽  
The City ◽  
Planning Problems

As a vital historic neighborhood with an indeterminate large-scale planning scheme, Yingping, located in the city center of Xiamen, China, is struggling with poor livability and growing incoherent private additions and renovations that largely undermine the local historic urban landscape. Inspired by Italian typology- and morphology-led planning techniques, this study explores the possible interpretations and implications of their applications in Yingping to address its interconnected, heterogeneous, and stratified urban fabric and planning problems. The research is developed through a two-pronged multi-layered planning framework. Firstly, from the maintenance perspective, five intervention approaches are grouped, with a specific focus on the leading structural elements of the urban fabric—the arcade streets. Secondly, from the morphological view and through the ecological lens, six characterized areas are identified and classified with respective morphological features and crucial planning problems being faced. This framework provides a strategic thematization of corresponding optimizing strategies and suitable guidelines to direct future governmental actions and to support the self-maintenance of local inhabitants toward sustainable development. The study also presents the possibility that such techniques are applicable to the Chinese context and is expected to inspire further research and practices in China and beyond.

A Non-Linear Machining Process Planner for Concurrent Mechanical Design

1993 ◽  
Author(s):  
Taro Ochiai ◽  
David A. Hoeltzel
Keyword(s):  
Process Planning ◽  
Computational Experiment ◽  
Mechanical Design ◽  
Machining Process ◽  
Planning Techniques ◽  
Combinatorial Explosion ◽  
Non Linear ◽  
Planning Strategies ◽  
Planning Problems ◽  
Typical Process

Abstract The performance of process planning systems is becoming increasingly more important within the context of concurrrent engineering. However, since planning strategies used in typical process planners cannot avoid combinatorial explosion without the appropriate use of domain heuristics, the planners cannot ensure acceptable performance for a more general class of machining problems. Using general non-linear planning techniques, we have developed a planner that attempts to cope with this problem. We establish a formulation for process planning using non-linear planning that enables graph-based conflict resolution. The planning mechanism is implemented using a production system in a computational experiment, and the possibility of generalization of this approach to other types of planning problems is discussed.

Planning Techniques for the Evaluation of Community Support Efficiency in Safety

1970 ◽  
Vol 12 (1) ◽  
pp. 47-54 ◽  
Author(s):  
Thomas W. Planek
Keyword(s):  
Community Support ◽  
The State ◽  
National Standards ◽  
Planning Techniques ◽  
Communication Problems ◽  
Safety Programs ◽  
Planning Problems

Community support is defined and a brief description of the background of support development is presented. Evaluation of safety programs in terms of compliance to national standards only is questioned. It is recommended that a program's relation to the state or local accident problem be the focus of evaluation. The planning problems associated with community support are analyzed. Techniques for solving these problems are recommended. Political and communication problems reducing support efficiency are analyzed and solutions suggested. An approach to the evaluation of action programs combining both practical and scientific considerations is presented.

Applying integer programming to AI planning

2000 ◽  
Vol 15 (1) ◽  
pp. 85-100 ◽  
Author(s):  
THOMAS VOSSEN ◽  
MICHAEL BALL ◽  
AMNON LOTEM ◽  
DANA NAU
Keyword(s):  
Integer Programming ◽  
Future Research ◽  
Ai Planning ◽  
Planning Techniques ◽  
Historical Difference ◽  
Planning Problems

Despite the historical difference in focus between AI planning techniques and Integer Programming (IP) techniques, recent research has shown that IP techniques show significant promise in their ability to solve AI planning problems. This paper provides approaches to encode AI planning problems as IP problems, describes some of the more significant issues that arise in using IP for AI planning, and discusses promising directions for future research.

scholarly journals Generalized Planning via Abstraction: Arbitrary Numbers of Objects

2019 ◽  
Vol 33 ◽  
pp. 7610-7618 ◽  
Author(s):  
León Illanes ◽  
Sheila A. McIlraith
Keyword(s):  
Generalized Solutions ◽  
Planning Problem ◽  
Promising Technique ◽  
Planning Techniques ◽  
Single Solution ◽  
Interesting Class ◽  
Planning Task ◽  
Problem Instances ◽  
Planning Problems ◽  
Infinite Set

We consider a class of generalized planning problems based on the idea of quantifying over sets of similar objects. We show how we can adapt fully observable nondeterministic planning techniques to produce generalized solutions that are easy to instantiate over particular problem instances. We also describe how we can reformulate a classical planning problem into a quantified one. The reformulation allows us to solve the original planning task without grounding every action with respect to all objects in the problem, and a single solution can be applied to a possibly infinite set of related classical planning tasks. We report experimental results that show our approach is a practical and promising technique for solving an interesting class of problems.

Dyadic Obligations over Complex Actions as Deontic Constraints in the Situation Calculus

2020 ◽  
Author(s):  
Jens Claßen ◽  
James Delgrande
Keyword(s):  
Artificial Intelligence ◽  
Deontic Logic ◽  
Action Theory ◽  
Prima Facie ◽  
Situation Calculus ◽  
Artificial Agents ◽  
Planning Techniques ◽  
Course Of Action ◽  
Reasoning About Action ◽  
The Given

With the advent of artificial agents in everyday life, it is important that these agents are guided by social norms and moral guidelines. Notions of obligation, permission, and the like have traditionally been studied in the field of Deontic Logic, where deontic assertions generally refer to what an agent should or should not do; that is they refer to actions. In Artificial Intelligence, the Situation Calculus is (arguably) the best known and most studied formalism for reasoning about action and change. In this paper, we integrate these two areas by incorporating deontic notions into Situation Calculus theories. We do this by considering deontic assertions as constraints, expressed as a set of conditionals, which apply to complex actions expressed as GOLOG programs. These constraints induce a ranking of "ideality" over possible future situations. This ranking in turn is used to guide an agent in its planning deliberation, towards a course of action that adheres best to the deontic constraints. We present a formalization that includes a wide class of (dyadic) deontic assertions, lets us distinguish prima facie from all-things-considered obligations, and particularly addresses contrary-to-duty scenarios. We furthermore present results on compiling the deontic constraints directly into the Situation Calculus action theory, so as to obtain an agent that respects the given norms, but works solely based on the standard reasoning and planning techniques.

Production management of standardized products using electronic process automation — single window

2020 ◽  
Keyword(s):  
Programming Languages ◽  
Production Management ◽  
Work Place ◽  
Web Interface ◽  
Process Automation ◽  
Control Programs ◽  
New Information ◽  
Shift Report ◽  
Planning Problems ◽  
Registration Card

A non-standard approach to solving the activation planning problems of the standardized products in a multinomenclature workshop is considered. This approach is caused by writing control programs and developing new information systems without changing previously developed workstations, which were created by using an outdated programming languages, in particular Clipper applications. The concept of creating a single information space — a set of databases and software tools integrated at the software level is proposed. Keywords standardized product; normal; software; web interface; single window; automatic work place; production task; shift task; order-shift report; control and registration card

Sign in / Sign up

Export Citation Format

Share Document