To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This chapter is about a refinement acting engine (RAE) used on a hierarchical task-oriented representation. It relies on an expressive, general-purpose language that offers rich programming control structures for online decision-making. A collection of refinement methods describes alternative ways to handle tasks and react to events. A method can be any complex algorithm, decomposing a task into subtasks and primitive actions. Subtasks are refined recursively. Nondeterministic actions trigger sensory-motor procedures that query and change the world nondeterministically. We assume that the methods are manually specified and that RAE chooses the appropriate method for the task and context at hand heuristically.
The recent developments of large language models (LLMs) and their extension in multimodal foundation models have introduced new perspectives in AI. An LLM is basically a very large neural net trained as a statistical predictor of the likely continuation of a sequence of words. LLMs have excellent competencies over a broad set of NLP tasks. Additionally, LLMs demonstrate the emergence of deliberation capabilities for reasoning, common sense, problem solving, code writing, and planning. These abilities have not been designed for in LLMs. They are unexpected and remain to a large extent poorly understood. Although error-prone and imperfect, they open up promising perspectives for acting, planning, and learning, which are presented in this chapter.
This chapter is about domain-independent classical-planning algorithms, which until recently were the most widely studied class of AI planning algorithms. The chapter classifies and describes a variety of forward search, backward search, and plan-space planning algorithms, as well as heuristics for guiding the algorithms.
This chapter sets the foundation for the next two chapters. It introduces the reader to robotics platforms for the development of acting, planning, and learning functions. The study of motion is based on classical mechanics for the modeling of forces and their effects on mouvements. Robotics builds on this knowledge to master computational motion, navigation, and manipulation over different types of devices and environments. Robotic devices are informally introduced in the following section. Motion problems and the metric representations with continuous state variables needed for geometric, kinematic, and dynamic operational models are then presented. Section 20.3 introduces localization and navigation problems, followed by a section on manipulation problems and their representations.
This chapter is about representing HTN planning domains and solving HTN planning problems. Several of the formal definitions require the same "classical planning" restrictions as in Part I, but most practical HTN implementations loosen or drop several of these restrictions. We first discuss ways to represent and solve planning problems in which there is a totally ordered sequence of tasks to accomplish. We then generalize to allow partially ordered tasks and describe ways to combine classical planning and HTN planning. Finally, we briefly discuss heuristic functions, expressivity, and computational complexity.
The chapters in Part II are about algorithms for planning, acting, and learning using hierarchical task networks (HTNs). HTNs can describe ways to perform complex tasks without the overhead of searching through a large state space, how to avoid situations where unanticipated events are likely to cause bad outcomes, and how to recover when unanticipated events occur.
This chapter discusses several ways for actors to use HTN domain models. These include a way to use HTN methods for purely reactive acting, some simple ways for an actor to make use of an HTN planner, and some ways to repair HTN plans when unexpected events occur during acting.
The hierarchical refinement approach in the previous two chapters requires a priori domain knowledge of the methods, action models, and heuristics used by RAE and UPOM. The topic of this chapter is to use machine learning techniques to synthesize planning heuristics and domain knowledge. It illustrates the "planning to learn" paradigm for learning domain-dependent heuristics to guide RAE and UPOM. Given methods and a sample function, UPOM generates near-optimal choices that are taken as targets by a deep Q-learning procedure. The chapter shows how to synthesize methods for tasks using hierarchical reinforcement techniques.
Oriented matroids appear throughout discrete geometry, with applications in algebra, topology, physics, and data analysis. This introduction to oriented matroids is intended for graduate students, scientists wanting to apply oriented matroids, and researchers in pure mathematics. The presentation is geometrically motivated and largely self-contained, and no knowledge of matroid theory is assumed. Beginning with geometric motivation grounded in linear algebra, the first chapters prove the major cryptomorphisms and the Topological Representation Theorem. From there the book uses basic topology to go directly from geometric intuition to rigorous discussion, avoiding the need for wider background knowledge. Topics include strong and weak maps, localizations and extensions, the Euclidean property and non-Euclidean properties, the Universality Theorem, convex polytopes, and triangulations. Themes that run throughout include the interplay between combinatorics, geometry, and topology, and the idea of oriented matroids as analogs to vector spaces over the real numbers and how this analogy plays out topologically.
Sea surface salinity and temperature are essential climate variables in monitoring and modeling ocean health. Multispectral ocean color satellites allow the estimation of these properties at a resolution of 10 to 300 m, which is required to correctly represent their spatial variability in coastal waters. This paper investigates the effect of pre-applying an unsupervised classification in the performance of both temperature and salinity inversion. Two methodologies were explored: clustering based solely on spectral radiances, and clustering applied directly to satellite images. The former improved model generalization by identifying similar water clusters across different locations, reducing location dependency. It also demonstrated results correlating cluster type with salinity and temperature distributions thereby enhancing regression model performance and improving a global ocean color sea surface temperature regression model RMSE error by 10%. The latter approach, applying clustering directly to satellite images, incorporated spatial information into the models and enabled the identification of front boundaries and gradient information, improving global sea surface temperature models RMSE by 20% and sea surface salinity models by 30%, compared to the initial ocean color model. Beyond improving algorithm performance, optical water classification can be used to monitor and interpret changes to water optics, including algal blooms, sediment disturbance or other climate change or antropogenic disturbances. For example, the clusters have been used to show the impact of a category 4 hurricane landfall on the Mississippi estuarine region.
This paper focuses on the feature-based visual-inertial odometry (VIO) in dynamic illumination environments. While the performance of most existing feature-based VIO methods is degraded by the dynamic illumination, which leads to unstable feature association, we propose a tightly-coupled VIO algorithm termed RAFT-VINS, integrating a Lite-RAFT tracker into the visual inertial navigation system (VINS). The key module of this odometry algorithm is a lightweight optical flow network designed for accurate feature tracking with real-time operation. It guarantees robust feature association in dynamic illumination environments and thereby ensures the performance of the odometry. Besides, to further improve the accuracy of the pose estimation, a moving consistency check strategy is developed in RAFT-VINS to identify and remove the outlier feature points. Meanwhile, a tightly-coupled optimization-based framework is employed to fuse IMU and visual measurements in the sliding window for efficient and accurate pose estimation. Through comprehensive experiments in the public datasets and real-world scenarios, the proposed RAFT-VINS is validated for its capacity to provide trustable pose estimates in challenging dynamic illumination environments. Our codes are open-sourced on https://github.com/USTC-AIS-Lab/RAFT-VINS.
The increasing prevalence of embedded software in today’s vehicles is leading to growing complexity, which can only be managed effectively through the use of reliable interdisciplinary engineering processes. With this in mind, systems engineering (SE) is currently being introduced on a large scale into the automotive industry. Pilot projects have demonstrated the potential for implementing changes, but these have not yet been accompanied by viable implementation concepts for SE. In the context of the proposed application-based research, the SETup automotive method (Systems Engineering Transformation under piloting in the automotive industry) is presented, which comprises a step-by-step procedure of introducing SE into large automotive companies. By introducing SE by pilot projects first, both an in-process tailoring of all processes, methods, tools and structures (PMTS) required for the introduction and an in-process validation of the pilot scheme elaborated by the pilot projects are achieved. The presented method builds upon fundamental approaches to change management, which have been developed over many years in both research and practice. It has been validated by the industrial practice of SE transformation at German car manufacturers and suppliers. As a result, decision-makers, transformation managers and systems engineers are provided with a scientifically based and field-tested set of steps for the introduction of SE in their own company.
The path navigation of robot in an entirely known space is presented by various researchers in the recent times. The navigational complexity arises when a robot moves in a completely unknown and complex environment from one defined start to a designated desired location. As the success of the nature-inspired algorithms in the unclear navigational problem is better, therefore, an improved butterfly optimization algorithm (IBOA) to determine the optimal feasible path for a humanoid robot navigating through a platform cluttered with both known and unfamiliar barriers is presented in this study. The BOA is inspired by the food-gathering habits of butterflies, where the sense of smell is the vital parameter in the global optimal search. However, the performance of this technique in the complex environment is poor, as a result, the chances of being trapped in local minima are more. Hence, the BOA is improved by using a nonlinear weight reduction strategy in updating the position of the butterflies in every iteration. The simulation is carried out in the Webots platform by considering variable-legged robot, NAO, in an unfamiliar environment. The outcomes derived from the simulation and real assessments demonstrate the potential of the proposed technique and compare with other existing algorithms, which highlights the potential and efficacy of the proposed IBOA algorithm.
In today’s ultra-connected world, personal and emotional narratives are omnipresent in media. This study examines how the emotional framing of second-hand testimonies about difficult or controversial past events influences attitudes. A sample of 154 Belgian participants, aged 18–77, evaluated their attitudes regarding Second World War (WWII) collaboration with Nazi Germany and the post-war repression before and after reading either the positively framed or negatively framed version of an ecologically valid interview. The narrative revolved around a son recounting his father’s past as a former collaborator joining the German forces during WWII. Results revealed a significant influence of the narrative’s emotional frame on attitudes towards collaboration and repression. The positively framed interview promoted more understanding attitudes towards collaboration and nuanced views on repression, while the opposite occurred with the negatively framed story, where participants viewed collaboration less favourably and regarded repression as justified and moral. Nevertheless, the role of emotions needs further investigation, exploring the medium of presentation of the narrative and considering the development of first-person narratives to elicit stronger emotional reactions.