Motorcycle-Security using Position Searching Algorithm Based on Hybrid Fuzzy-Dijkstra

2016 ◽  
Vol 3 (2) ◽  
pp. 468 ◽  
Author(s):  
Rofiq Mubarok ◽  
Dwi Verdy Firmansyah ◽  
Dheny Haryanto ◽  
Noor Pratama Apriyanto ◽  
Umniyatul Mahmudah ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Decision Making ◽  
Shortest Path ◽  
Search Algorithm ◽  
Safety System ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Position Information ◽  
Motorcycle Safety ◽  
Artificial Intelligence Algorithm

<strong>Motorcycle safety system has been provided by the manufacturer in the form of a handlebar lock and electrical key equipped with alarms. Keys provided by the manufacturers sometimes fail in securing a motorcycle. In addition the safety system does not provide position information of the stolen motorcycle to the owner. With these problems, the paper presents safety locked motorcycle equipped with artificial intelligence algorithms. Artificial intelligence algorithm is used to find and detect the location of the motorcycle using the shortest path algorithm. This paper applies search algorithm using Dijkstra algorithm where the algorithm is used to make the decision to get the location of the motorcycle. By using the algorithm, the location of the motorcycle can be detected but it is not able to find the shortest path needed. Therefore, this paper describes the modification of Dijkstra algorithm by adding a Fuzzy algorithm that is used for the weight values in decision making, so that it can pursue to find the shortest path.</strong>

Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

Novel Application of Artificial Intelligence with Potential to Transform Well Planning Workflows on the Norwegian Continental Shelf

2021 ◽  
Author(s):  
Jon Gustav Vabø ◽  
Evan Thomas Delaney ◽  
Tom Savel ◽  
Norbert Dolle
Keyword(s):  
Artificial Intelligence ◽  
Decision Making ◽  
Continental Shelf ◽  
Data Science ◽  
Search Algorithm ◽  
Solution Space ◽  
Good Decision ◽  
Trade Offs ◽  
Well Trajectory ◽  
Norwegian Continental Shelf

Abstract This paper describes the transformational application of Artificial Intelligence (AI) in Equinor's annual well planning and maturation process. Well planning is a complex decision-making process, like many other processes in the industry. There are thousands of choices, conflicting business drivers, lots of uncertainty, and hidden bias. These complexities all add up, which makes good decision making very hard. In this application, AI has been used for automated and unbiased evaluation of the full solution space, with the objective to optimize the selection of drilling campaigns while taking into account complex issues such as anti-collision with existing wells, drilling hazards and trade-offs between cost, value and risk. Designing drillable well trajectories involves a sequence of decisions, which makes the process very suitable for AI algorithms. Different solver architectures, or algorithms, can be used to play this game. This is similar to how companies such as Google-owned DeepMind develop customized solvers for games such as Go and StarCraft. The chosen method is a Tree Search algorithm with an evolutionary layer on top, providing a good balance in terms of performance (i.e., speed) vs. exploration capability (i.e., it looks "wide" in the option space). The algorithm has been deployed in a full stack web-based application that allows users to follow an end-2-end workflow: from defining well trajectory design rules and constraints to running the AI engine and evaluating results to the optimization of multi-well drilling campaigns based on risk, value and cost objectives. The full-size paper describes different Norwegian Continental Shelf (NCS) use cases of this AI assisted well trajectory planning. Results to-date indicate significant CAPEX savings potential and step-change improvements in decision speed (months to days) compared to routine manual workflows. There are very limited real transformative examples of Artificial Intelligence in multi- disciplinary workflows. This paper therefore gives a unique insight how a combination of data science, domain expertise and end user feedback can lead to powerful and transformative AI solutions – implemented at scale within an existing organization.

Application of Shortest-Path Algorithm in Embedded GIS System

2013 ◽  
Vol 663 ◽  
pp. 626-631
Author(s):  
Hong Xia Sun ◽  
Zheng Zhang
Keyword(s):  
Network Analysis ◽  
Emergency Response ◽  
Shortest Path ◽  
Program Implementation ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Emergency Response System ◽  
Gps Navigation ◽  
Embedded Gis ◽  
Gis System

The shortest-path is an important issue in GIS network analysis, and its implementation in embedded systems has already been used widely in the mobile-device-based GPS navigation and city emergency response system fields. Based on our analysis and verification of the Dijkstra algorithm’s application to road network analysis, we presented in detail the design and program implementation of the Dijkstra algorithm and its flow chart. In this paper, the shortest-path example based on Dijkstra algorithm，which was developed in the MapXmobile5.0 and EVC4.0 environment, has been applied to embedded GIS system successfully. The comparison between the results from the program and manually obtained results has shown the Dijkstra algorithm’s feasibility and accuracy.

Pursuit Algorithm for Robot Trash Can Based on Fuzzy-Cell Decomposition

2016 ◽  
Vol 6 (6) ◽  
pp. 2863
Author(s):  
Tatiya Padang Tunggal ◽  
Andi Supriyanto ◽  
Nur Mukhammad Zaidatur Rochman ◽  
Ibnu Faishal ◽  
Imam Pambudi ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Shortest Path ◽  
Cell Decomposition ◽  
Robot Path Planning ◽  
Shortest Distance ◽  
Artificial Intelligence Algorithm ◽  
Time Required ◽  
Fuzzy Cell ◽  
Destination Point ◽  
Robot Path

<p>Scooby Smart Trash can is a trash can equipped with artificial intelligence algorithms that is able to capture and clean up garbages thrown by people who do not care about the environment. The can is called smart because it acts like scoobydoo in a children's cartoon in that the can will react if there is garbage thrown and it catches and cleans them up. This paper presents pursuit algorithm that uses cell decomposition algorithm in which algorithms are used to create a map of the robot's path and fuzzy algorithm as one of the artificial intelligence algorithm for robot path planning. By using the combined algorithms, the robot is able to pursuit and chases the trash carelessly discarded, but it has not been able to find the shortest distance. Therefore, this paper considers a second modification of the algorithm by adding a potential field algorithm used to add weight values on the map, so that the robot can pursue trash by finding the shortest path. The proposed algorithm shows that the robot can avoid obstacles and find the shortest path so that the time required to get to the destination point is fast.</p>

scholarly journals An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 421
Author(s):  
Mina Asaduzzaman ◽  
Tan Kim Geok ◽  
Ferdous Hossain ◽  
Shohel Sayeed ◽  
Azlan Abdaziz ◽  
...  
Keyword(s):  
Shortest Path ◽  
Real World ◽  
Indoor Environment ◽  
Minimum Weight ◽  
Single Source ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Real World Data ◽  
Minimal Weight ◽  
Multiple Item

The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially in supermarkets, warehouses, libraries, etc. However, when it is used for multiple item searches, its weight becomes higher as it searches only the shortest path between the single sources to each destination item separately. If the conventional Dijkstra algorithm is modified to multi-destination mode then the weight is decreased, but the output path is not considered as the real shortest path among multiple destinations items. Our proposed algorithm is more efficient for finding the shortest path among multiple destination items with minimum weight, compared to the single source single destination and modified multi-destinations of Dijkstra’s algorithm. In this research, our proposed method has been validated by real-world data as well as by simulated random solutions. Our advancement is more applicable in indoor environment applications based on multiple items or destinations searching.

scholarly journals A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

2020 ◽  
Vol 16 (1) ◽  
pp. 65-70
Author(s):  
Siti Lestari Lestari ◽  
Ardiansyah Ardiansyah ◽  
Angelina Puput Giovani ◽  
Desy Dwijayanti
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Shortest Path ◽  
Rapid Development ◽  
Residential Area ◽  
Daily Activities ◽  
Dijkstra Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

scholarly journals Algoritma Dijkstra untuk Penentuan Jarak Tempuh Terpendek Pengantaran Katering Pabrik

MIND Journal ◽  
2021 ◽  
Vol 5 (2) ◽  
pp. 108-120
Author(s):  
THETA DINNARWATY PUTRI ◽  
WINARNO SUGENG ◽  
EKA SAFITRI
Keyword(s):  
Artificial Intelligence ◽  
Travel Time ◽  
Shortest Path ◽  
Dijkstra Algorithm ◽  
Initial Location ◽  
The City

AbstrakAlgoritma Dijkstra digunakan untuk menemukan jalur terpendek antara titik pada graf dan persamaan Haversine digunakan untuk mengukur jarak dari lokasi awal menuju lima lokasi tujuan yang mana lokasi tersebut merupakan pabrik yang berada di kota Cikarang dan lokasinya ada di sekitaran penyedia rumah catering. Perhitungan dilakukan setelah sistem mendapatkan koordinat latitude dan longitude pengguna dan lokasi pabrik yang dituju. Pada penelitian ini, lokasi pengguna dan lokasi pabrik dilakukan di kota Cikarang. Sistem mampu menampilkan prediksi jarak dan waktu tempuh untuk  rekomendasi dari urutan lima pengantaran dengan penerapan metode algoritma Dijkstra dimana proses yang dilakukan sistem adalah memperhitungkan jarak menggunakan Haversine Formula, sehingga didapatkan waktu tempuh berdasarkan parameter kemacetan. selain itu API mampu memvisualisasikan rute setiap tujuan dari titik lokasi katering.Kata kunci: Dijkstra, Formula Haversine, PHP, Jarak terpendek, Kecerdasan Buatan.AbstractThe algorithm is used to find the shortest path between points on a graph. The Haversine formula is used to measure the distance from the initial location to the five destination locations where the factory is located in Cikarang and the location is around the location catering house. Calculations are carried out after the system gets the user’s latitude and longitude coordinates and the intended factory. In this study, the location of the user and the location of the factory were carried out in the city of Cikarang. The system is suitable to display distance and travel time predictions for recommendations from the order of five deliveries by applying the Dijkstra algorithm method. The process that is carried out by the system, calculates the distance using Haversine formula. Thus, the travel time is obtained bases on congestion parameters. In Addition, besides the API is able to visualize the route of each destination from the catering location point.Keywords: Dijkstra, Haversine Formula, PHP, Shortest Path, Artificial Intelligence.

Sign in / Sign up

Export Citation Format

Share Document