Path optimization with limited sensing ability (Q729301): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hao-Min Zhou / rank
Normal rank
 
Property / author
 
Property / author: Hao-Min Zhou / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
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.jcp.2015.07.037 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1410272359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility optimization using variational approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum watchman routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order implicit strong numerical schemes for stochastic differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of point clouds and exploratory path planning in unkown environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes under limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Level set methods and dynamic implicit surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility and its dynamics in a PDE based implicit framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945523 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:57, 13 July 2024

scientific article
Language Label Description Also known as
English
Path optimization with limited sensing ability
scientific article

    Statements

    Path optimization with limited sensing ability (English)
    0 references
    0 references
    0 references
    0 references
    20 December 2016
    0 references
    path planning
    0 references
    limited coverage
    0 references
    complete scan
    0 references

    Identifiers