L* Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-0409
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
L* Algorithm—A Linear Computational Complexity Graph Searching Algorithm for Path Planning ; day:11 ; month:12 ; year:2017 ; pages:1-20
Journal of intelligent & robotic systems ; (11.12.2017), 1-20
- Creator
-
Niewola, Adam
- Contributor
-
Podsedkowski, Leszek
SpringerLink (Online service)
- DOI
-
10.1007/s10846-017-0748-6
- URN
-
urn:nbn:de:1111-20180207473
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:02 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Niewola, Adam
- Podsedkowski, Leszek
- SpringerLink (Online service)
Other Objects (12)
Guarding and Reconfiguration : Computational Complexity and Algorithm Design
Low-complexity lattice reduction algorithm for MIMO detectors with tree searching
Qualitative reasoning about relative directions : computational complexity and practical algorithm
Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm [[Elektronische Ressource]]
An algorithm with improved complexity for pebble motion/Multi-Agent path finding on trees
Path following algorithm application to automatic berthing control
A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
The risk of algorithm transparency: How algorithm complexity drives the effects on use of advice
Searching algorithm of theodolite auto-focusing based on compound focal judgment
A quantum algorithm for searching a target solution of fixed weight
Modified Dual-Path Allocation Algorithm in Elastic Optical Networks
A Fast Shortest Path Algorithm on Terrain-like Graphs
Guarding and Reconfiguration : Computational Complexity and Algorithm Design
Low-complexity lattice reduction algorithm for MIMO detectors with tree searching
Qualitative reasoning about relative directions : computational complexity and practical algorithm
Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm [[Elektronische Ressource]]
An algorithm with improved complexity for pebble motion/Multi-Agent path finding on trees
Path following algorithm application to automatic berthing control
A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
The risk of algorithm transparency: How algorithm complexity drives the effects on use of advice
Searching algorithm of theodolite auto-focusing based on compound focal judgment
A quantum algorithm for searching a target solution of fixed weight
Modified Dual-Path Allocation Algorithm in Elastic Optical Networks
A Fast Shortest Path Algorithm on Terrain-like Graphs
Guarding and Reconfiguration : Computational Complexity and Algorithm Design
Low-complexity lattice reduction algorithm for MIMO detectors with tree searching
Qualitative reasoning about relative directions : computational complexity and practical algorithm
Qualitative Reasoning about Relative Directions : Computational Complexity and Practical Algorithm [[Elektronische Ressource]]
An algorithm with improved complexity for pebble motion/Multi-Agent path finding on trees
Path following algorithm application to automatic berthing control
A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal
The risk of algorithm transparency: How algorithm complexity drives the effects on use of advice
Searching algorithm of theodolite auto-focusing based on compound focal judgment
A quantum algorithm for searching a target solution of fixed weight
Modified Dual-Path Allocation Algorithm in Elastic Optical Networks