Results 31 to 40 of about 16,261 (217)
Optimal distribution of vehicular traffic flow with Dijkstra’s algorithm and Markov chains
African Scientific ReportsThe optimization of traffic distribution is a critical problem in transportation networks, where efficient routing can reduce congestion, minimize travel time, and improve overall traffic flow.
L. I. Igbinosun, N. R. Udoenoh
doaj +1 more source
International Journal of Computational Intelligence Systems, 2020 In this paper, we will present a N-Non-Intersecting-Routing (NNIR) algorithm which is used to reduce the cost of resilient routing in telecommunications problems.
Lewis Veryard +4 more
doaj +1 more source
Making more flexible ATISMART+ model for traffic simulations using a CAS [PDF]
, 2015 Traffic simulations usually require the search of a path to join two different points. Dijkstra’s algorithm [1] is one of the most commonly used for this task due to its easiness and quickness.
Aguilera-Venegas, Gabriel +5 more
core
Landmark Guided Probabilistic Roadmap Queries
, 2017 A landmark based heuristic is investigated for reducing query phase run-time of the probabilistic roadmap (\PRM) motion planning method. The heuristic is generated by storing minimum spanning trees from a small number of vertices within the \PRM graph ...
Frazzoli, Emilio +2 more
core +1 more source
Revision of Specification Automata under Quantitative Preferences [PDF]
, 2014 We study the problem of revising specifications with preferences for automata based control synthesis problems. In this class of revision problems, the user provides a numerical ranking of the desirability of the subgoals in their specifications.
Fainekos, Georgios, Kim, Kangjin
core +1 more source
Advanced Intelligent Discovery, EarlyView.Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
Path planning algorithm for a car like robot based on Coronoi Diagram Method [PDF]
, 2013 The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. The algorithm is based on Voronoi diagram method for the environment
Inun, Haidie
core
A nearly-mlogn time solver for SDD linear systems [PDF]
, 2011 We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\bar{x} = b$ for some (unknown ...
Koutis, Ioannis +2 more
core +1 more source
Advanced Intelligent Systems, EarlyView.This study presents a multitask strategy for plastic cleanup with autonomous surface vehicles, combining exploration and cleaning phases. A two‐headed Deep Q‐Network shared by all agents is traineded via multiobjective reinforcement learning, producing a Pareto front of trade‐offs.
Dame Seck +4 more
wiley +1 more source
Routing in triple loop circulants: A case of networks-on-chip
Heliyon, 2020 In this paper we propose and analyze various approaches to organizing routing in a triple loop circulant topologies as applied to networks-on-chip: static routing based on universal graph search algorithms, such as Dijkstra's algorithm and a possible ...
Aleksandr Yu. Romanov +1 more
doaj +1 more source