On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048876543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining approximate shortest paths on weighted polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating shortest paths on weighted polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted region problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Movement planning in the presence of flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding approximate optimal paths in weighted regions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:18, 2 July 2024

scientific article
Language Label Description Also known as
English
On discretization methods for approximating optimal paths in regions with direction-dependent costs
scientific article

    Statements

    On discretization methods for approximating optimal paths in regions with direction-dependent costs (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    robotic path planning
    0 references
    computational geometry
    0 references
    optimization
    0 references
    0 references