Flight-schedule using Dijkstra's algorithm with comparison of routes findings

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

Implementation of Dijkstra Algorithm with React Native to Determine Covid-19 Distribution

Since Covid-19 was declared a global pandemic because it has spread throughout the world, every effort has been made to help prevent and tackle the transmission of Covid-19, including information technology. Information technology developed to determine the shortest distance for Covid-19 cases around us needs to be developed. This research implements Dijkstra's Algorithm written in the React Native programming language to build a Covid-19 tracking application. The system can display the closest distance with a radius of at least one meter, and the test results can map the nearest radius of 41 meters and the most immediate radius of 147 meters. This system is built for the compatibility of Android OS and iOS applications with React Native programming.

PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,

The Simulation of Traffic Signal Preemption using GPS and Dijkstra Algorithm for Emergency Fire Handling at Makassar City Fire Service

The Makassar City Fire Department often faces obstacles in handling fires. Problems that often hinder such as congestion at crossroads, panic residents, and others. The result of this research is a system that can assist firefighters when handling fire cases in terms of accelerating the firefighting team to the location of the fire. Dijkstra's algorithm will be used to find the shortest path to the fire location and the travel time. Then the traffic signal preemption simulation adjusts the color of the lights when the GPS vehicle approaches the traffic lights on the path to be traversed. The simulation results show that the use of traffic signal preemption in collaboration with Dijkstra's algorithm and GPS can help the performance of the Makassar City Fire Department, especially for handling fires that require fast time.

Optimized Graph Search Algorithms for Exploration with Mobile Robot

Graph search algorithms and shortest path algorithms, designed to allow real mobile robots to search unknown environments, are typically run in a hybrid manner, which results in the fast exploration of an entire environment using the shortest path. In this study, a mobile robot explored an unknown environment using separate depth-first search (DFS) and breadth-first search (BFS) algorithms. Afterward, developed DFS + Dijkstra and BFS + Dijkstra algorithms were run for the same environment. It was observed that the newly developed hybrid algorithm performed the identification using less distance. In experimental studies with real robots, progression with DFS for the first-time discovery of an unknown environment is very efficient for detecting boundaries. After finding the last point with DFS, the shortest route was found with Dijkstra for the robot to reach the previous node. In defining a robot that works in a real environment using DFS algorithm for movement in unknown environments and Dijkstra algorithm in returning, time and path are shortened. The same situation was tested with BFS and the results were examined. However, DFS + Dijkstra was found to be the best algorithm in field scanning with real robots. With the hybrid algorithm developed, it is possible to scan the area with real autonomous robots in a shorter time. In this study, field scanning was optimized using hybrid algorithms known.

Motion Planning of Ground Simulator for Space Instable Target Based on Energy Saving

In order to achieve the high-precision motion trajectory in ground experiment of space instable target (SIT) while reducing the energy consumption of the motion simulator, a robot motion planning method based on energy saving is proposed. Observable-based ground robot motion experiment system for SIT is designed and motion planning process is illustrated. Discrete optimization mathematical model of energy consumption of motion simulator is established. The general motion form of the robot joints in ground test is given. The optimal joint path of motion simulator based on energy consumption under discontinuous singularity configuration is solved by constructing the complete energy consumption directed path and Dijkstra algorithm. An improved method by adding the global optimization algorithm is used to decouple the coupled robot joints to obtain the minimum energy consumption path under the continuous singularity configuration of the motion simulator. Simulations are carried out to verify the proposed solution. The simulation data show that total energy saving of motion simulator joints adopting the proposed method under the condition of non-singularity configuration, joints coupled motion with continuous singularity configuration, and coexistence of non-singularity path and continuous singularity path are, respectively, 72.67%, 28.24%, and 62.23%, which proves that the proposed method can meet the requirements of ground motion simulation for SIT and effectively save energy.

Vision Based Indoor Surveillance Patrol Robot Using Extended Dijkstra Algorithm in Path Plannin

Vision based patrol robot has been with great interest nowadays due to its consistency, cost effectiveness and no temperament issue. In recent times, Global positioning system (GPS) has been cooperated with Global Navigation Satellite System (GNSS) to come out with better accuracy quality in positioning, navigation, and timing (PNT) services to locate a device. However, such localization service is yet to reach any indoor facility. For an indoor surveillance vision based patrol robot, such limitation hinders its path planning capabilities that allows the patrol robot to seek for the optimum path to reach the appointed destination and return back to its home position. In this paper, a vision based indoor surveillance patrol robot using sensory manipulation technique is presented and an extended Dijkstra algorithm is proposed for the patrol robot path planning. The design of the patrol robot adopted visual type sensor, range sensors and Inertia Measurement Unit (IMU) system to impulsively update the map’s data in line with the patrol robot’s current path and utilize the path planning features to carry out obstacle avoidance and re-routing process in accordance to the obstacle’s type met by the patrol robot. The result conveyed by such approach certainly managed to complete multiple cycles of testing with positive result.