Results 31 to 40 of about 3,683 (185)

An Efficient Approach for Solving Time-Dependent Shortest Path Problem under Fermatean Neutrosophic Environment [PDF]

open access: yesNeutrosophic Sets and Systems
Efficiently determining optimal paths and calculating the least travel time within complex networks is of utmost importance in addressing transportation challenges.
K. Vidhya, A. Saraswathi, Said Broumi
doaj   +1 more source

Robot Path Planning of Improved Adaptive Ant Colony System Algorithm Based on Dijkstra

open access: yesJournal of Robotics, 2022
Path planning is one of the key technologies of robot. Aiming at the problems of slow convergence speed and inefficient search of traditional Ant Colony System Algorithm, an adaptive Ant Colony System Algorithm based on Dijkstra is proposed in the paper.
Chonglin Gu   +3 more
doaj   +1 more source

Path Planning Algorithms for Smart Parking: Review and Prospects

open access: yesWorld Electric Vehicle Journal
Path planning algorithms are crucial components in the process of smart parking. At present, there are many path planning algorithms designed for smart parking.
Zhonghai Han   +5 more
doaj   +1 more source

Delivery Route Management based on Dijkstra Algorithm

open access: yesمجلة بغداد للعلوم, 2021
For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs
Ng Lih Sheng   +3 more
doaj   +1 more source

Automating AI Discovery for Biomedicine Through Knowledge Graphs and Large Language Models Agents

open access: yesAdvanced Intelligent Discovery, EarlyView.
This work proposes a novel framework that automates biomedical discovery by integrating knowledge graphs with multiagent large language models. A biologically aligned graph exploration strategy identifies hidden pathways between biomedical entities, and specialized agents use this pathway to iteratively design AI predictors and wet‐lab validation ...
Naafey Aamer   +3 more
wiley   +1 more source

Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train

open access: yesIJID (International Journal on Informatics for Development), 2019
This study aims to find out the comparison of Dijkstra and Floyd-Warshall algorithms in finding the best path on a train trip.  The best route is the path, which has the minimum price of a train journey.
Tri Setya Dermawan
doaj   +1 more source

Motion and Morphology Planning for Autonomous Manipulation in Clutter With a Shape‐Shifting, Variable‐Stiffness Robot

open access: yesAdvanced Intelligent Systems, EarlyView.
A hybrid mobile robot with a modular Variable‐Stiffness Bridge transitions between a rigid locomotion platform and a flexible, shape‐conforming body. By enclosing objects within its deformable structure rather than relying on dedicated end effectors, the robot achieves orientation‐regulated planar transport, with conformal contact quality shown to ...
Luiza Labazanova   +5 more
wiley   +1 more source

An algorithm for operational navigation in urban development using reinforcement learning [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
This paper presents a navigation system for unmanned aerial vehicles (UAVs) operating in urban environments, where the main challenges include changes to the city layout that may not be reflected on existing maps.
I. Alyrchikov   +3 more
doaj   +1 more source

Strategic Impact of EU Taxonomy on Pharmaceutical Firms' Performance

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT Sustainability has become a central concern in economic policy and corporate governance, increasingly formalised through regulatory frameworks of the European Union (EU). The European Commission has published the EU Taxonomy, which allows economic activities and their contribution to sustainability to be analysed, taking into account ...
Alicia Ramírez‐Orellana   +3 more
wiley   +1 more source

RRT algorithm for path clipping of robotic arm guided by graph complexity

open access: yesXi'an Gongcheng Daxue xuebao
Aimed at the issues of slow convergence speed, high path redundancy, and low sampling point utilization caused by the random sampling characteristics of the rapidly-exploring random tree (RRT) algorithm, a new solution was proposed.First, the graph ...
SHEN Danfeng   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy