IEEE Access Special Section Editorial: Big Data Technology and Applications in Intelligent Transportation

During the last few years, information technology and transportation industries, along with automotive manufacturers and academia, are focusing on leveraging intelligent transportation systems (ITS) to improve services related to driver experience, connected cars, Internet data plans for vehicles, traffic infrastructure, urban transportation systems, traffic collaborative management, road traffic accidents analysis, road traffic flow prediction, public transportation service plan, personal travel route plans, and the development of an effective ecosystem for vehicles, drivers, traffic controllers, city planners, and transportation applications. Moreover, the emerging technologies of the Internet of Things (IoT) and cloud computing have provided unprecedented opportunities for the development and realization of innovative intelligent transportation systems where sensors and mobile devices can gather information and cloud computing, allowing knowledge discovery, information sharing, and supported decision making. However, the development of such data-driven ITS requires the integration, processing, and analysis of plentiful information obtained from millions of vehicles, traffic infrastructures, smartphones, and other collaborative systems like weather stations and road safety and early warning systems. The huge amount of data generated by ITS devices is only of value if utilized in data analytics for decision-making such as accident prevention and detection, controlling road risks, reducing traffic carbon emissions, and other applications which bring big data analytics into the picture

A Comprehensive Overview of Classical and Modern Route Planning Algorithms for Self-Driving Mobile Robots

Mobile robots are increasingly being applied in a variety of sectors, including agricultural, firefighting, and search and rescue operations. Robotics and autonomous technology research and development have played a major role in making this possible. Before a robot can reliably and effectively navigate a space without human aid, there are still several challenges to be addressed. When planning a path to its destination, the robot should be able to gather information from its surroundings and take the appropriate actions to avoid colliding with obstacles along the way. The following review analyses and compares 200 articles from two databases, Scopus and IEEE Xplore, and selects 60 articles as references from those articles. This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. Classical or traditional methods, such as Roadmaps (Visibility Graph and Voronoi Diagram), Potential Fields, and Cell Decomposition, and modern methodologies such as heuristic-based (Dijkstra Method, A* Algorithms, and D* Algorithms), metaheuristics algorithms (such as PSO, Bat Algorithm, ACO, and Genetic Algorithm), and neural systems such as fuzzy neural networks or fuzzy logic (FL) and Artificial Neural Networks (ANN) are described in this report. In this study, we outline the ideas, benefits, and downsides of modeling and path-searching technologies for a mobile robot

Motion Planning for Autonomous Ground Vehicles Using Artificial Potential Fields: A Review

Autonomous ground vehicle systems have found extensive potential and practical applications in the modern world. The development of an autonomous ground vehicle poses a significant challenge, particularly in identifying the best path plan, based on defined performance metrics such as safety margin, shortest time, and energy consumption. Various techniques for motion planning have been proposed by researchers, one of which is the use of artificial potential fields. Several authors in the past two decades have proposed various modified versions of the artificial potential field algorithms. The variations of the traditional APF approach have given an answer to prior shortcomings. This gives potential rise to a strategic survey on the improved versions of this algorithm. This study presents a review of motion planning for autonomous ground vehicles using artificial potential fields. Each article is evaluated based on criteria that involve the environment type, which may be either static or dynamic, the evaluation scenario, which may be real-time or simulated, and the method used for improving the search performance of the algorithm. All the customized designs of planning models are analyzed and evaluated. At the end, the results of the review are discussed, and future works are proposed

The Sequence Optimization of the Railway Tree-Shaped Special Line\u27s Shunting for Taking-out and Placing-in of Wagons

Shunting for taking-out and placing-in of wagons (STPW) is an important work of freight stations, technical stations with more cargo operations, and large intermediate stations.The sequence optimization of STPW can effectively reduce the total shunting time and reduce operating costs, which is of great significance. When the optimization goal is to minimize the total shunting time, there will be many optimal solutions. Therefore, it is necessary to introduce a second optimization objective in order to seek a more reasonable solution from numerous optimal solutions. However, there is no relevant research on this in existing literature. In response to this situation, this paper proposes two optimization objectives: the first is to minimize the total time of STPW, and the second is to minimize the wagon-hour based on minimizing the total time of STPW. Based on the above two optimization objectives, a mathematical model is established, and a three-stage optimization solution strategy is proposed. The first stage is to solve the first optimization objective by using the improved ant colony algorithm; the second stage is to introduce and improve the crossover operation of the genetic algorithm to improve the diversity of the optimal path; the third stage is to solve the second optimization objective. Finally, an example is given to verify the feasibility of the model and the solution strategy

IoT in smart communities, technologies and applications.

Internet of Things is a system that integrates different devices and technologies, removing the necessity of human intervention. This enables the capacity of having smart (or smarter) cities around the world. By hosting different technologies and allowing interactions between them, the internet of things has spearheaded the development of smart city systems for sustainable living, increased comfort and productivity for citizens. The Internet of Things (IoT) for Smart Cities has many different domains and draws upon various underlying systems for its operation, in this work, we provide a holistic coverage of the Internet of Things in Smart Cities by discussing the fundamental components that make up the IoT Smart City landscape, the technologies that enable these domains to exist, the most prevalent practices and techniques which are used in these domains as well as the challenges that deployment of IoT systems for smart cities encounter and which need to be addressed for ubiquitous use of smart city applications. It also presents a coverage of optimization methods and applications from a smart city perspective enabled by the Internet of Things. Towards this end, a mapping is provided for the most encountered applications of computational optimization within IoT smart cities for five popular optimization methods, ant colony optimization, genetic algorithm, particle swarm optimization, artificial bee colony optimization and differential evolution. For each application identified, the algorithms used, objectives considered, the nature of the formulation and constraints taken in to account have been specified and discussed. Lastly, the data setup used by each covered work is also mentioned and directions for future work have been identified. Within the smart health domain of IoT smart cities, human activity recognition has been a key study topic in the development of cyber physical systems and assisted living applications. In particular, inertial sensor based systems have become increasingly popular because they do not restrict users’ movement and are also relatively simple to implement compared to other approaches. Fall detection is one of the most important tasks in human activity recognition. With an increasingly aging world population and an inclination by the elderly to live alone, the need to incorporate dependable fall detection schemes in smart devices such as phones, watches has gained momentum. Therefore, differentiating between falls and activities of daily living (ADLs) has been the focus of researchers in recent years with very good results. However, one aspect within fall detection that has not been investigated much is direction and severity aware fall detection. Since a fall detection system aims to detect falls in people and notify medical personnel, it could be of added value to health professionals tending to a patient suffering from a fall to know the nature of the accident. In this regard, as a case study for smart health, four different experiments have been conducted for the task of fall detection with direction and severity consideration on two publicly available datasets. These four experiments not only tackle the problem on an increasingly complicated level (the first one considers a fall only scenario and the other two a combined activity of daily living and fall scenario) but also present methodologies which outperform the state of the art techniques as discussed. Lastly, future recommendations have also been provided for researchers

PERFORMANCE IMPACT OF DISPATCHING AND ROUTING IN AN AUTOMATED GUIDED VEHICLE SYSTEM

Dispatching and routing are fundamental operational decisions in automated material-handling systems. Numerous studies have been conducted on these two operational decisions, with more focus being recently made on intelligent routing decisions. However, comparative studies between the effects of dispatching and routing methods have not been reported so far. In this study, we have investigated three dispatching and three routing algorithms and measured their impacts using a simulation model for an automated guided vehicle (AGV) system designed for a real-world production line, in which a grid-type material flow layout is used, and the AGVs need to stop before changing their direction of movement. Two routing algorithms are developed in this study. Simulation experiments revealed that both dispatching and routing algorithms affect the performance of the AGV system, although dispatching methods showed a more significant impact. Good dispatching and routing algorithms are mandatory to improve the overall performance of AGV systems

A generalized laser simulator algorithm for optimal path planning in constraints environment

Path planning plays a vital role in autonomous mobile robot navigation, and it has thus become one of the most studied areas in robotics. Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. This approach allows finding the path for a mobile robot while avoiding obstacles, searching for a goal, considering some constraints and finding an optimal path during the robot movement in both known and unknown environments. The feasible path is determined between the start and goal positions by generating a wave of points in all directions towards the goal point with adhering to constraints. A simulation study employing the proposed approach is applied to the grid map settings to determine a collision-free path from the start to goal positions. First, the grid mapping of the robot's workspace environment is constructed, and then the borders of the workspace environment are detected based on the new proposed function. This function guides the robot to move toward the desired goal. Two concepts have been implemented to find the best candidate point to move next: minimum distance to goal and maximum index distance to the boundary, integrated by negative probability to sort out the most preferred point for the robot trajectory determination. In order to construct an optimal collision-free path, an optimization step was included to find out the minimum distance within the candidate points that have been determined by GLS while adhering to particular constraint's rules and avoiding obstacles. The proposed algorithm will switch its working pattern based on the goal minimum and boundary maximum index distances. For static obstacle avoidance, the boundaries of the obstacle(s) are considered borders of the environment. However, the algorithm detects obstacles as a new border in dynamic obstacles once it occurs in front of the GLS waves. The proposed method has been tested in several test environments with different degrees of complexity. Twenty different arbitrary environments are categorized into four: Simple, complex, narrow, and maze, with five test environments in each. The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. The GLS is 7.8 and 5.5 times faster than A* and LS, respectively, generating a path 1.2 and 1.5 times shorter than A* and LS. The mean value of the path cost achieved by the proposed approach is 4% and 15% lower than PRM and RRT, respectively. The mean path cost generated by the LS algorithm, on the other hand, is 14% higher than that generated by the PRM. Finally, to verify the performance of the developed method for generating a collision-free path, experimental studies were carried out using an existing WMR platform in labs and roads. The experimental work investigates complete autonomous WMR path planning in the lab and road environments using live video streaming. The local maps were built using data from live video streaming s by real-time image processing to detect the segments of the lab and road environments. The image processing includes several operations to apply GLS on the prepared local map. The proposed algorithm generates the path within the prepared local map to find the path between start-to-goal positions to avoid obstacles and adhere to constraints. The experimental test shows that the proposed method can generate the shortest path and best smooth trajectory from start to goal points in comparison with the laser simulator

How to Mitigate Traffic Congestion Based on Improved Ant Colony Algorithm: A Case Study of a Congested Old Area of a Metropolis

Old areas of metropolises play a crucial role in their development. The main factors restricting further progress are primitive road transportation planning, limited space, and dense population, among others. Mass transit systems and public transportation policies are thus being adopted to make an old area livable, achieve sustainable development, and solve transportation problems. Identifying old areas of metropolises as a research object, this paper puts forth an improved ant colony algorithm and combines it with virtual reality. This paper predicts traffic flow in Yangpu area on the basis of data obtained through Python, a programming language. On comparing the simulation outputs with reality, the results show that the improved model has a better simulation effect, and can take advantage of the allocation of traffic resources, enabling the transport system to achieve comprehensive optimization of time, cost, and accident rates. Subsequently, this paper conducted a robustness test, the results of which show that virtual traffic simulation based on the improved ant colony algorithm can effectively simulate real traffic flow, use vehicle road and signal resources, and alleviate overall traffic congestion. This paper offers suggestions to alleviate traffic congestion in old parts of metropolises. Document type: Articl

Modelling human network behaviour using simulation and optimization tools: the need for hybridization

The inclusion of stakeholder behaviour in Operations Research / Industrial Engineering (OR/IE) models has gained much attention in recent years. Behavioural and cognitive traits of people and groups have been integrated in simulation models (mainly through agent-based approaches) as well as in optimization algorithms. However, especially the influence of relations between different actors in human networks is a broad and interdisciplinary topic that has not yet been fully investigated. This paper analyses, from an OR/IE point of view, the existing literature on behaviour-related factors in human networks. This review covers different application fields, including: supply chain management, public policies in emergency situations, and Internet-based human networks. The review reveals that the methodological approach of choice (either simulation or optimization) is highly dependent on the application area. However, an integrated approach combining simulation and optimization is rarely used. Thus, the paper proposes the hybridization of simulation with optimization as one of the best strategies to incorporate human behaviour in human networks and the resulting uncertainty, randomness, and dynamism in related OR/IE models.Peer Reviewe