Results 201 to 210 of about 22,360 (263)

Path Optimization for Cluster Order Picking in Warehouse Robotics Using Hybrid Symbolic Control and Bio-Inspired Metaheuristic Approaches. [PDF]

Biomimetics (Basel)
Özbaltan M, Çaşka S, Yıldırım M, Şeker C, Aysal FE, Bıçakcı Yeşilkaya HS, Demir M, Kuzu E.   +7 more
europepmc   +1 more source

Geometrical Optimal Navigation and Path Planning-Bridging Theory, Algorithms, and Applications. [PDF]

Sensors (Basel)
Jafarpourdavatgar H, Saeedinia SA, Mohaghegh M.   +2 more
europepmc   +1 more source

An efficient coverage path planning method for UAV in complex concave regions. [PDF]

Sci Rep
Wu W, Wang Z, Lin L, Chang X, Tian L.
europepmc   +1 more source

Leveraging similarity and community-based features for link prediction in temporal social networks using attention-enabled LSTM. [PDF]

Sci Rep
Ahuja R, Kaur S, Shakya HK, Singh SS.
europepmc   +1 more source

An Enhanced A*-DWA Fusion Algorithm for Robot Navigation in Complex Environments. [PDF]

Biomimetics (Basel)
Bao H, Fang J, Fang M, Zhang J, Zhang Z, Cai H.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Shortest Path Problems

2000
Consider a digraph G = (V, E) with non- negative costs c(e) = c ij (∀ e = (i, j) ∈ E) associated with the edges in G. To simplify further notation we define c ij := ∞ for all (i, j) ∉ E.
Horst W. Hamacher, Kathrin Klamroth
openaire   +2 more sources

Thek-centrum shortest path problem

TOP, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Garfinkel, Robert, Fernández, Elena, Lowe, Timothy J.   +2 more
openaire   +1 more source