Robot path planning based on concept lattice
From MaRDI portal
Publication:2677852
Recommendations
- A robot path planning algorithm based on cellular automata
- Reliable robust path planning with application to mobile robots
- Path planning of continuum robot based on path fitting
- Mobile robot path planning for fine‐grained and smooth path spcification
- ROBOT PATH PLANNING BASED ON MODIFIED GREY RELATIONAL ANALYSIS
- Path planning for robobt manipulators in polyhhedral objects environment
- Robot path planning in a constrained workspace by using optimal control techniques
- Path-based approach to integrated planning and control for robotic systems
Cites work
- A note on two problems in connexion with graphs
- Concept learning via granular computing: a cognitive viewpoint
- Depth-first iterative-deepening: An optimal admissible tree search
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 2243401 (Why is no real title available?)
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
- Lifelong planning \(\text{A}^*\)
Cited in
(2)
This page was built for publication: Robot path planning based on concept lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677852)