共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
In this paper, the off-line path planner module of a smart wheelchair aided navigation system is described. Environmental information is structured into a hierarchical graph (H-graph) and used either by the user interface or the path planner module. This information structure facilitates efficient path search and easier information access and retrieval. Special path planning issues like planning between floors of a building (vertical path planning) are also viewed. The H-graph proposed is modelled by a tree. The hierarchy of abstractions contained in the tree has several levels of detail. Each abstraction level is a graph whose nodes can represent other graphs in a deeper level of the hierarchy. Path planning is performed using a path skeleton which is built from the deepest abstraction levels of the hierarchy to the most upper levels and completed in the last step of the algorithm. In order not to lose accuracy in the path skeleton generation and speed up the search, a set of optimal subpaths are previously stored in some nodes of the H-graph (path costs are partially materialized). Finally, some experimental results are showed and compared to traditional heuristic search algorithms used in robot path planning. 相似文献
4.
Amy L. Lansky 《Computational Intelligence》1988,4(3):319-340
This paper presents the GEM concurrency model and GEMPLAN, a multiagent planner based on this model. Unlike standard state-based AI representations, GEM is unique in its explicit emphasis on events and domain structure. In particular, a world domain is modeled as a set of regions composed of interrelated events. Event-based temporal-logic constraints are then associated with each region to delimit legal domain behavior. The GEMPLAN planner directly reflects this emphasis on domain structure and constraints. It can be viewed as a general-purpose constraint satisfaction facility which constructs a network of interrelated events (a “plan”) that is subdivided into regions (“subplans”), satisfies all applicable regional constraints, and also achieves some stated goal. GEMPLAN extends and generalizes previous planning architectures in the range of constraint forms it handles and in the flexibility of its constraint satisfaction search strategy. One critical aspect of our work has been an emphasis on localized reasoning—techniques that make explicit use of domain structure. For example, GEM localizes the applicability of domain constraints and imposes additional “locality constraints” on the basis of domain structure. Together, constraint localization and locality constraints provide semantic information that can be used to alleviate several aspects of the frame problem for multiagent domains. The GEMPLAN planner reflects the use of locality by subdividing its constraint satisfaction search space into regional planning search spaces. Utilizing constraint and property localization, GEMPLAN can pinpoint and rectify interactions among these regional search spaces, thus reducing the burden of “interaction analysis” ubiquitous to most planning systems. Because GEMPLAN is specifically geared towards parallel, multiagent domains, we believe that its natural application areas will include scheduling and other forms of organizational coordination. 相似文献
5.
The importance of solving the problem of integrating deliberative (“planning”) capabilities and reactive capabilities when building robust, ‘real-world’ robot systems is becoming widely accepted (Bresina and Drummond, 1990; Fraichard and Laugier, 1991; McDermott, 1991). This paper presents a solution to this problem: cast planning as the incremental adaptation of a reactive system to suit changes in goals or the environment. Our application domain is a manufacturing problem - robotic kitting. This paper represents an advance on existing work in two ways: It presents and formally examines an architecture that incorporates the benefits of a deliberative component without compromising the reactive component. Secondly, it provides the first set of performance statistics in the literature for this class of system. In our approach, the reactive system (the reactor) is a real-time system that continually interacts with the environment, and the planner is a separate and concurrent system that incrementally ‘tunes’ the behavior of the reactor to ensure that goals are achieved. We call this the planner-reactor approach. The reactor is described using a formal framework for representing flexible robot plans, the
model (Lyons, 1990; Lyons and Arbib, 1989). Thus, the behavior of the reactor, and the rules by which the reactor can be modified, become open to mathematical analysis. We employ this to determine the constraints the planner must abide by to make safe adaptations and to ensure that incremental adaptations converge to a desired reactor. We discuss our current implementation of planner and reactor, work through an example from the kitting robot application, and present implementation results. 相似文献
6.
The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed reasoning with simulated execution. Researchers have implemented a series of planners that utilize this search strategy, and demonstrated that it is an efficient technique, a fair match to other successful planners; however, they have provided few formal results on the common principles underlying the developed algorithms. We formalize bidirectional planning, elucidate some techniques for improving its efficiency and show how different strategies for controlling search complexity give rise to different versions of PRODIGY. In particular, we demonstrate that PRODIGY is not complete and discuss advantages and drawbacks of its incompleteness. We then develop a complete bidirectional planner and compare it experimentally with PRODIGY. We show that the complete planner is almost as fast as PRODIGY and solves a wider range of problems. 相似文献
7.
Autonomous Driving with Concurrent Goals and Multiple Vehicles: Mission Planning and Architecture 总被引:1,自引:1,他引:0
We introduce a new distributed planning paradigm, which permits optimal execution and dynamic replanning of complex multi-goal missions. In particular, the approach permits dynamic allocation of goals to vehicles based on the current environment model while maintaining information-optimal route planning for each individual vehicle to individual goals. Complex missions can be specified by using a grammar in which ordering of goals, priorities, and multiple alternatives can be described. We show that the system is able to plan local paths in obstacle fields based on sensor data, to plan and update global paths to goals based on frequent obstacle map updates, and to modify mission execution, e.g., the assignment and ordering of the goals, based on the updated paths to the goals.The multi-vehicle planning system is based on the GRAMMPS planner; the on-board dynamic route planner is based on the D* planner. Experiments were conducted with stereo and high-speed ladar as the to sensors used for obstacle detection. This paper focuses on the multi-vehicle planner and the systems architecture. A companion paper (Brumitt et al., 2001) analyzes experiments with the multi-vehicle system and describes in details the other components of the system. 相似文献
8.
This article describes a framework for practical social reasoning designed to be used for analysis, specification, and implementation of the social layer of agent reasoning in multiagent systems. Our framework, called the expectation strategy behavior (ESB) framework, is based on (i) using sets of update rules for social beliefs tied to observations (so‐called expectations), (ii) bounding the amount of reasoning to be performed over these rules by defining a reasoning strategy, and (iii) influencing the agent's decision‐making logic by means of behaviors conditioned on the truth status of current and future social beliefs. We introduce the foundations of ESB conceptually and present a formal framework and an actual implementation of a reasoning engine, which is specifically combined with a general (belief–desire–intention‐based) practical reasoning programming system. We illustrate the generality of ESB through select case studies, which show that it is able to represent and implement different typical styles of social reasoning. The broad coverage of existing social reasoning methods, the modularity that derives from its declarative nature, and its focus on practical implementation make ESB a useful tool for building advanced socially reasoning agents. 相似文献
9.
We propose multicontext systems (MC systems) as a formal framework for the specification of complex reasoning. MC systems provide the ability to structure the specification of “global” reasoning in terms of “local” reasoning subpatterns. Each subpattern is modeled as a deduction in a context, formally defined as an axiomatic formal system. the global reasoning pattern is modeled as a concatenation of contextual deductions via bridge rules, i.e., inference rules that infer a fact in one context from facts asserted in other contexts. Besides the formal framework, in this article we propose a three-layer architecture designed to specify and automatize complex reasoning. At the first level we have object-level contexts (called s-contexts) for domain specifications. Problem-solving principles and, more in general, meta-level knowledge about the application domain is specified in a distinct context, called Problem-Solving Context (PSC). On top of s-contexts and PSC, we have a further context, called MT, where it is possible to specify strategies to control multicontext reasoning spanning through s-contexts and PSC. We show how GETFOL can be used as a computer tool for the implementation of MC systems and for the automatization of multicontext deductions. © 1995 John Wiley & Sons, Inc. 相似文献
10.
Burstein Mark McDermott Drew Smith Douglas R. Westfold Stephen J. 《Autonomous Agents and Multi-Agent Systems》2003,6(3):265-286
Getting agents to communicate requires translating the data structures of the sender (the source representation) to the format required by the receiver (the target representation). Assuming that there is a formal theory of the semantics of the two formats, which explains both their meanings in terms of a neutral topic domain, we can cast the translation problem as solving higher-order functional equations. Some simple rules and strategies apparently suffice to solve these equations automatically. The strategies may be summarized as: decompose complex expressions, replacing topic-domain expressions with source-domain expressions when necessary. A crucial issue is getting the required formal theories of the source and target domains. We believe it is sufficient to find partial formalizations that grow as necessary. 相似文献
11.
An enhanced genetic algorithm for automated assembly planning 总被引:15,自引:0,他引:15
Automated assembly planning reduces manufacturing manpower requirements and helps simplify product assembly planning, by clearly defining input data, and input data format, needed to complete an assembly plan. In addition, automation provides the computational power needed to find optimal or near-optimal assembly plans, even for complex mechanical products. As a result, modern manufacturing systems use, to an ever greater extent, automated assembly planning rather than technician-scheduled assembly planning. Thus, many current research reports describe efforts to develop more efficient automated assembly planning algorithms. Genetic algorithms show particular promise for automated assembly planning. As a result, several recent research reports present assembly planners based upon traditional genetic algorithms. Although prior genetic assembly planners find improved assembly plans with some success, they also tend to converge prematurely at local-optimal solutions. Thus, we present an assembly planner, based upon an enhanced genetic algorithm, that demonstrates improved searching characteristics over an assembly planner based upon a traditional genetic algorithm. In particular, our planner finds optimal or near-optimal solutions more reliably and more quickly than an assembly planner that uses a traditional genetic algorithm. 相似文献
12.
13.
TALplanner: A temporal logic based forward chaining planner 总被引:1,自引:0,他引:1
Jonas Kvarnström Patrick Doherty 《Annals of Mathematics and Artificial Intelligence》2000,30(1-4):119-169
We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented
as formulas in the Temporal Action Logic (TAL). TAL is a narrative based linear metric time logic used for reasoning about
action and change in incompletely specified dynamic environments. TAL is used as the formal semantic basis for TALplanner,
where a TAL goal narrative with control formulas is input to TALplanner which then generates a TAL narrative that entails
the goal and control formulas. The sequential version of TALplanner is presented. The expressivity of plan operators is then
extended to deal with an interesting class of resource types. An algorithm for generating concurrent plans, where operators
have varying durations and internal state, is also presented. All versions of TALplanner have been implemented. The potential
of these techniques is demonstrated by applying TALplanner to a number of standard planning benchmarks in the literature.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
14.
J. L. Pons R. Ceres A. R. Jiménez L. Calderón J. M. Martin 《Journal of Intelligent and Robotic Systems》1997,18(3):277-287
The precise control of manipulators depends nonlinearly on the velocity of the motion as well as on manipulator configuration and commanded acceleration requiring complex control strategies. This paper presents a useful tool for identifying and quantifying nonlinear effects appearing during the motion of any manipulator, the Nonlinear Performance Index (npi). The npi takes into account not only the geometrical parameters defining the manipulator but also its structural dynamics through the use of inertial parameters like mass, inertia, centre of mass... The npi can be used in the design stage for analysing and reducing these undesirable nonlinear effects in any general motion or in the trajectory planning looking for paths along which more precise control is expected. The last part of the paper shows how this design optimisation and path planning has been applied to the Agribot, a fruit picking robot designed at the IAI. 相似文献
15.
Kyohei Otsu Guillaume Matheron Sourish Ghosh Olivier Toupet Masahiro Ono 《野外机器人技术杂志》2020,37(5):768-785
We present a light‐weight body‐terrain clearance evaluation algorithm for the automated path planning of NASA's Mars 2020 rover. Extraterrestrial path planning is challenging due to the combination of terrain roughness and severe limitation in computational resources. Path planning on cluttered and/or uneven terrains requires repeated safety checks on all the candidate paths at a small interval. Predicting the future rover state requires simulating the vehicle settling on the terrain, which involves an inverse‐kinematics problem with iterative nonlinear optimization under geometric constraints. However, such expensive computation is intractable for slow spacecraft computers, such as RAD750, which is used by the Curiosity Mars rover and upcoming Mars 2020 rover. We propose the approximate clearance evaluation (ACE) algorithm, which obtains conservative bounds on vehicle clearance, attitude, and suspension angles without iterative computation. It obtains those bounds by estimating the lowest and highest heights that each wheel may reach given the underlying terrain, and calculating the worst‐case vehicle configuration associated with those extreme wheel heights. The bounds are guaranteed to be conservative, hence ensuring vehicle safety during autonomous navigation. ACE is planned to be used as part of the new onboard path planner of the Mars 2020 rover. This paper describes the algorithm in detail and validates our claim of conservatism and fast computation through experiments. 相似文献
16.
The diffusion of domotic and ambient intelligence systems have introduced a new vision in which autonomous deliberative agents operate in environments where reactive responses of devices can be cooperatively exploited to fulfill the agent's goals. In this article a model for automated planning in reactive environments, based on numerical planning, is introduced. A planner system, based on mixed integer linear programming techniques, which implements the model, is also presented. The planner is able to reason about the dynamic features of the environment and to produce solution plans, which take into account reactive devices and their causal relations with agent's goals by exploitation and avoidance techniques, to reach a given goal state. The introduction of reactive domains in planning poses some issues concerning reasoning patterns which are briefly depicted. Experiments of planning in reactive domains are also discussed. 相似文献
17.
智能规划器StepByStep的研究和开发 总被引:3,自引:0,他引:3
智能规划器是智能规划研究成果的重要表现形式,规划器的求解效率和规划质量是智能规划理论研究的直接反映.首先介绍智能规划器的一般结构和StepByStep规划器的总体结构,然后详细阐述StepByStep规划器各组成部分所采用的方法和策略,定义谓词知识树来提取领域知识.在谓词知识树的基础上定义谓词规划树,并用各种策略来提高规划树的生成效率.在谓词规划树的基础上设计StepByStep的规划策略,最后用8个规划器对3个具有代表性的基准规划领域及其规划问题进行实际的求解实验,分析了StepByStep规划器在求解效率和规划质量上的具体表现.实验数据表明,StepByStep规划器的规划策略对3个不同规划领域都具有很好的指导作用,验证了领域知识在规划求解过程中的实际价值. 相似文献
18.
K. IoannidisAuthor Vitae G.Ch. Sirakoulis Author VitaeI. Andreadis Author Vitae 《Robotics and Autonomous Systems》2011,59(2):113-127
Creating collision-free trajectories for mobile robots, known as the path planning problem, is considered to be one of the basic problems in robotics. In case of multiple robotic systems, the complexity of such systems increases proportionally with the number of robots, due to the fact that all robots must act as one unit to complete one composite task, such as retaining a specific formation. The proposed path planner employs a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every robot of a team while their formation is kept immutable. The method reacts with obstacle distribution changes and therefore can be used in dynamical or unknown environments, without the need of a priori knowledge of the space. The team is divided into subgroups and all the desired pathways are created with the combined use of a CA path planner and an ACO algorithm. In case of lack of pheromones, paths are created using the CA path planner. Compared to other methods, the proposed method can create accurate collision-free paths in real time with low complexity while the implemented system is completely autonomous. A simulation environment was created to test the effectiveness of the applied CA rules and ACO principles. Moreover, the proposed method was implemented in a system using a real world simulation environment, called Webots. The CA and ACO combined algorithm was applied to a team of multiple simulated robots without the interference of a central control. Simulation and experimental results indicate that accurate collision free paths could be created with low complexity, confirming the robustness of the method. 相似文献
19.
本文提出了一种未知环境下基于A*的机器人路径规划算法。采用基于A*算法的二次路径规划策略,机器人在遇到未知障碍物的情况下能有效地进行路径重规划;采用基于优先级的子节点生成策略,考虑了机器人的宽度信息,使规划路径能在真实的物理机器人上得到执行;最后,通过MobileSim仿真平台和Pioneer P3DX真实机器人验证了此算法的有效性和可靠性。基于A~*的新算法拓宽了原算法的适用范围,提高了机器人的智能水平和实时路径规划能力。 相似文献
20.
In object programming languages, the Visitor design pattern allows separation of algorithms and data structures. When applying this pattern to tree‐like structures, programmers are always confronted with the difficulty of making their code evolve. One reason is that the code implementing the algorithm is interwound with the code implementing the traversal inside the visitor. When implementing algorithms such as data analyses or transformations, encoding the traversal directly into the algorithm turns out to be cumbersome as this type of algorithm only focuses on a small part of the data‐structure model (e.g., program optimization). Unfortunately, typed programming languages like Java do not offer simple solutions for expressing generic traversals. Rewrite‐based languages like ELAN or Stratego have introduced the notion of strategies to express both generic traversal and rule application control in a declarative way. Starting from this approach, our goal was to make the notion of strategic programming available in a widely used language such as Java and thus to offer generic traversals in typed Java structures. In this paper, we present the strategy language SL that provides programming support for strategies in Java. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献