Programming for modular reconfigurable robots

DOI10.1134/S0361768812010033MaRDI QIDQ1758696zbMATH OpenFDO

Authors A. A. Gorbenko, Vladimir Popov

Publication date 16 November 2012

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

self-reconfigurable modular robotsself-reconfigurationoptimal reconfiguration planning problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)

Recommendations

• Asymptotically optimal kinodynamic motion planning for a class of modular self-reconfigurable robots
• Evaluating efficiency of self-reconfiguration in a class of modular robots
• Multiagent control of self-reconfigurable robots.
• Asymptotically optimal kinodynamic motion planning for self-reconfigurable robots
• scientific article; zbMATH DE number 2226171

Cites work

• scientific article; zbMATH DE number 1538056 (Why is no real title available?)
• scientific article; zbMATH DE number 1869460 (Why is no real title available?)
• scientific article; zbMATH DE number 780784 (Why is no real title available?)
• scientific article; zbMATH DE number 956857 (Why is no real title available?)
• A generalized kinematic modeling method for modular robots
• A machine program for theorem-proving
• Embedding complex decision procedures inside an interactive theorem prover.
• Genetic and hybrid algorithms for graph coloring
• Logics in Artificial Intelligence
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Optimal kinodynamic motion planning for 2D reconfiguration of self-reconfigurable robots
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae
• Planning as satisfiability: parallel plans and algorithms for plan search
• Principles and Practice of Constraint Programming – CP 2004
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• Theory and Applications of Satisfiability Testing

Cited in

(18)

• Network-based reconfiguration routes for a self-reconfigurable robot
• scientific article; zbMATH DE number 1869459 (Why is no real title available?)
• scientific article; zbMATH DE number 1869457 (Why is no real title available?)
• A membrane computing framework for self-reconfigurable robots
• Program complex for modelling a manipulating robot
• Mathematical and algorithmic models of reconfiguration of a modular robotic system
• Towards a general-purpose, reversible language for controlling self-reconfigurable robots
• scientific article; zbMATH DE number 1887332 (Why is no real title available?)
• Asymptotically optimal kinodynamic motion planning for self-reconfigurable robots
• Asymptotically optimal kinodynamic motion planning for a class of modular self-reconfigurable robots
• Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization
• Programmable reconfiguration of Physarum machines
• Multiagent control of self-reconfigurable robots.
• Task-based optimization of modular robot configurations: minimized degree-of-freedom approach
• scientific article; zbMATH DE number 1700402 (Why is no real title available?)
• An energy suboptimal reconfiguration planning approach to wheel-manipulator robots
• Configuration representation and reconfiguration optimization for the reconfigurable robots with independent manipulation
• Center-configuration selection technique for the reconfigurable modular robot

Describes a project that uses

Uses Software

• DIMACS
• Walksat

This page was built for publication: Programming for modular reconfigurable robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1758696)