A critical evaluation of literature on robot path planning in dynamic environment

Robot Path Planning (RPP) in dynamic environments is a search problem based on the examination of collision-free paths in the presence of dynamic and static obstacles. Many techniques have been developed to solve this problem. Trapping in a local minima and maintaining a Real-Time performance are known as the two most important challenges that these techniques face to solve such problem. This study presents a comprehensive survey of the various techniques that have been proposed in this domain. As part of this survey, we include a classification of the approaches and identify their methods.

Multi-finger grasps in a dynamic environment

Most current state-of-the-art haptic devices render only a single force, however almost all human grasps are characterised by multiple forces and torques applied by the fingers and palms of the hand to the object. In this chapter we will begin by considering the different types of grasp and then consider the physics of rigid objects that will be needed for correct haptic rendering. We then describe an algorithm to represent the forces associated with grasp in a natural manner. The power of the algorithm is that it considers only the capabilities of the haptic device and requires no model of the hand, thus applies to most practical grasp types. The technique is sufficiently general that it would also apply to multi-hand interactions, and hence to collaborative interactions where several people interact with the same rigid object. Key concepts in friction and rigid body dynamics are discussed and applied to the problem of rendering multiple forces to allow the person to choose their grasp on a virtual object and perceive the resulting movement via the forces in a natural way. The algorithm also generalises well to support computation of multi-body physics

Financial reporting policy in a dynamic environment

To cope with the increasing globalisation of capital markets, financial regulators in Australia have embarked on an ambitious program to converge national accounting standards with International Financial Reporting Standards. The convergence program means a significant departure from present financial reporting policy and will necessitate substantial change by reporting entities. The effectiveness of the existing differential reporting policy is drawn into question in the light of the changes taking place. An evaluation of the perceptions of the effectiveness of the extant differential reporting model is undertaken and alternative policy approaches considered. The findings indicate that certain aspects of the differential reporting model have inherent problems not necessarily related to the recent policy change and that corrective action needs to be undertaken to maintain its relevance.

Profiling pedestrian distribution and anomaly detection in a dynamic environment

Pedestrians movements have a major impact on the dynamics of cities and provide valuable guidance to city planners. In this paper we model the normal behaviours of pedestrian flows and detect anomalous events from pedestrian counting data of the City of Melbourne. Since the data spans an extended period, and pedestrian activities can change intermittently (e.g., activities in winter vs. summer), we applied an Ensemble Switching Model, which is a dynamic anomaly detection technique that can accommodate systems that switch between different states. The results are compared with those produced by a static clustering model (Hy-CARCE) and also cross-validated with known events. We found that the results from the Ensemble Switching Model are valid and more accurate than HyCARCE.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

Dynamic robot path planning using an enhanced simulated annealing approach

Evolutionary computation is an effective tool for solving optimization problems. However, its significant computational demand has limited its real-time and on-line applications, especially in embedded systems with limited computing resources, e.g., mobile robots. Heuristic methods such as the genetic algorithm (GA) based approaches have been investigated for robot path planning in dynamic environments. However, research on the simulated annealing (SA) algorithm, another popular evolutionary computation algorithm, for dynamic path planning is still limited mainly due to its high computational demand. An enhanced SA approach, which integrates two additional mathematical operators and initial path selection heuristics into the standard SA, is developed in this work for robot path planning in dynamic environments with both static and dynamic obstacles. It improves the computing performance of the standard SA significantly while giving an optimal or near-optimal robot path solution, making its real-time and on-line applications possible. Using the classic and deterministic Dijkstra algorithm as a benchmark, comprehensive case studies are carried out to demonstrate the performance of the enhanced SA and other SA algorithms in various dynamic path planning scenarios.

Modern sedimentary environments and dynamic depositional systems in the southern Yellow Sea

Based on analyses of more than 600 surface sediment samples together with large amounts of previous sedimentologic and hydrologic data, the characteristics of modern sedimentary environments and dynamic depositional systems in the southern Yellow Sea (SYS) are expounded, and the controversial formation mechanism of muddy sediments is also discussed. The southern Yellow Sea shelf can be divided into low-energy sedimentary environment and high-energy sedimentary environment; the low-energy sedimentary environment can be further divided into cyclonic and anticyclonic ones, and the high-energy environment is subdivided into high-energy depositional and eroded environments. In the shelf low-energy environments, there developed muddy depositional system. In the central part of the southern Yellow Sea, there deposited the cold eddy sediments under the actions of a meso-scale cyclonic eddy (cold eddy), and in the southeast of the southern Yellow Sea, an anticyclonic eddy muddy depositional system (warm eddy sediment) was formed. These two types of sediments showed evident differences in grain size, sedimentation rate, sediment thickness and mineralogical characteristics. The high-energy environments were covered with sandy sediments on seabed; they appeared mainly in the west, south and northeast of the southern Yellow Sea. In the high-energy eroded environment, large amounts of sandstone gravels were distributed on seabed. In the high-energy depositional environment, the originally deposited fine materials (including clay and fine silt) were gradually re-suspended and then transported to a low-energy area to deposit again. In this paper, the sedimentation model of cyclonic and anticyclonic types of muddy sediments is established, and a systematic interpretation for the formation cause of muddy depositional systems in the southern Yellow Sea is given.

Dynamic task allocation and coordination in cooperative multi-agent environments

La coordinació i assignació de tasques en entorns distribuïts ha estat un punt important de la recerca en els últims anys i aquests temes són el cor dels sistemes multi-agent. Els agents en aquests sistemes necessiten cooperar i considerar els altres agents en les seves accions i decisions. A més a més, els agents han de coordinar-se ells mateixos per complir tasques complexes que necessiten més d'un agent per ser complerta. Aquestes tasques poden ser tan complexes que els agents poden no saber la ubicació de les tasques o el temps que resta abans de que les tasques quedin obsoletes. Els agents poden necessitar utilitzar la comunicació amb l'objectiu de conèixer la tasca en l'entorn, en cas contrari, poden perdre molt de temps per trobar la tasca dins de l'escenari. De forma similar, el procés de presa de decisions distribuït pot ser encara més complexa si l'entorn és dinàmic, amb incertesa i en temps real. En aquesta dissertació, considerem entorns amb sistemes multi-agent amb restriccions i cooperatius (dinàmics, amb incertesa i en temps real). En aquest sentit es proposen dues aproximacions que permeten la coordinació dels agents. La primera és un mecanisme semi-centralitzat basat en tècniques de subhastes combinatòries i la idea principal es minimitzar el cost de les tasques assignades des de l'agent central cap als equips d'agents. Aquest algoritme té en compte les preferències dels agents sobre les tasques. Aquestes preferències estan incloses en el bid enviat per l'agent. La segona és un aproximació d'scheduling totalment descentralitzat. Això permet als agents assignar les seves tasques tenint en compte les preferències temporals sobre les tasques dels agents. En aquest cas, el rendiment del sistema no només depèn de la maximització o del criteri d'optimització, sinó que també depèn de la capacitat dels agents per adaptar les seves assignacions eficientment. Addicionalment, en un entorn dinàmic, els errors d'execució poden succeir a qualsevol pla degut a la incertesa i error de accions individuals. A més, una part indispensable d'un sistema de planificació és la capacitat de re-planificar. Aquesta dissertació també proveeix una aproximació amb re-planificació amb l'objectiu de permetre als agent re-coordinar els seus plans quan els problemes en l'entorn no permeti la execució del pla. Totes aquestes aproximacions s'han portat a terme per permetre als agents assignar i coordinar de forma eficient totes les tasques complexes en un entorn multi-agent cooperatiu, dinàmic i amb incertesa. Totes aquestes aproximacions han demostrat la seva eficiència en experiments duts a terme en l'entorn de simulació RoboCup Rescue.

Social and material influences on the Kelabit dwelt environment

Relations with the environment are key to the ways in which people pursue their dwelling practices. The complex processes of globalisation challenge the isolation of rural groups, consequently affecting their perception and use of the environment. One such place where this can be seen is the Kelabit Highlands of northern Sarawak (Malaysian Borneo), where the recent arrival of commercial logging has allowed local people to make wider connections via the logging roads. Cultural and historic traditions are reconstituted in the light of new material relations with a dynamic environment, which can be seen reflected in changing customs of housebuilding.

Multi-robot hunting in dynamic environments

This paper is concerned with multi-robot hunting in dynamic environments. A BCSLA approach is proposed to allow mobile robots to capture an intelligent evader. During the process of hunting, four states including dispersion-random-search, surrounding, catch and prediction are employed. In order to ensure each robot appropriate movement in each state, a series of strategies are developed in this paper. The dispersion-search strategy enables the robots to find the evader effectively. The leader-adjusting strategy aims to improve the hunting robots’ response to environmental changes and the outflank strategy is proposed for the hunting robots to force the evader to enter a besieging circle. The catch strategy is designed for shrinking the besieging circle to catch the evader. The predict strategy allows the robots to predict the evader’s position when they lose the tracking information about the evader. A novel collision-free motion strategy is also presented in this paper, which is called the direction-optimization strategy. To test the effect of cooperative hunting, the target to be captured owns a safety-motion strategy, which helps it to escape being captured. The computer simulations support the rationality of the approach.

Understanding data quality issues in dynamic organisational environments – a literature review

Technology has been the catalyst that has facilitated an explosion of organisational data in terms of its velocity, variety, and volume, resulting in a greater depth and breadth of potentially valuable information, previously unutilised. The variety of data accessible to organisations extends beyond traditional structured data to now encompass previously unobtainable and difficult to analyse unstructured data. In addition to exploiting data, organisations are now facing an even greater challenge of assessing data quality and identifying the impacts of lack of quality. The aim of this research is to contribute to data quality literature, focusing on improving a current understanding of business-related Data Quality (DQ) issues facing organisations. This review builds on existing Information Systems literature, and proposes further research in this area. Our findings confirm that the current literature lags in recognising new types of data and imminent DQ impacts facing organisations in today’s dynamic environment of the so-called “Big Data”. Insights clearly identify the need for further research on DQ, in particular in relation to unstructured data. It also raises questions regarding new DQ impacts and implications for organisations, in their quest to leverage the variety of available data types to provide richer insights.