Nothing Special   »   [go: up one dir, main page]

Ben-Shahar et al., 1998 - Google Patents

Practical pushing planning for rearrangement tasks

Ben-Shahar et al., 1998

View PDF
Document ID
18333686515828300393
Author
Ben-Shahar O
Rivlin E
Publication year
Publication venue
IEEE Transactions on Robotics and Automation

External Links

Snippet

We address the problem of practical manipulation planning for rearrangement tasks of many movable objects. We study a special case of the rearrangement task, where the only allowed manipulation is pushing. We search for algorithms that can provide practical planning time …
Continue reading at cs-www.cs.yale.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
Ben-Shahar et al. Practical pushing planning for rearrangement tasks
Chen et al. SANDROS: a dynamic graph search algorithm for motion planning
Latombe Probabilistic roadmaps for robot path planning
Koenig et al. Fast replanning for navigation in unknown terrain
Barraquand et al. A random sampling scheme for path planning
Svestka et al. Probabilistic path planning
Cai et al. Optimal probabilistic motion planning with potential infeasible LTL constraints
Galindo et al. Improving efficiency in mobile robot task planning through world abstraction
Palacios et al. Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations.
Ayala et al. Temporal logic motion planning in unknown environments
Şucan et al. On the implementation of single-query sampling-based motion planners
Aarno et al. Artificial potential biased probabilistic roadmap method
Yalciner et al. Hybrid conditional planning using answer set programming
Khanmirza et al. A comparative study of deterministic and probabilistic mobile robot path planning algorithms
Hwang et al. A heuristic and complete planner for the classical mover's problem
Haslum et al. Extending classical planning with state constraints: Heuristics and search for optimal planning
Moghaddam et al. Planning robot navigation among movable obstacles (NAMO) through a recursive approach
Švestka et al. Probabilistic path planning
Jun et al. Shortest path planning in discretized workspaces using dominance relation
Undeger et al. Real-time edge follow: A real-time path search approach
González Fast Marching Methods in path and motion planning: improvements and high-level applications
Ben-Shahar et al. To push or not to push: on the rearrangement of movable objects by a mobile robot
Balakirsky A framework for planning with incrementally created graphs in attributed problem spaces
Strub Leveraging multiple sources of information to search continuous spaces
Saddem et al. Decomposing the model-checking of mobile robotics actions on a grid