Programming for modular reconfigurable robots

DOI10.1134/S0361768812010033zbMath1251.68256MaRDI QIDQ1758696

A. A. Gorbenko, V. Yu. 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)

Related Items (1)

Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization

Uses Software

• Walksat
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
• Embedding complex decision procedures inside an interactive theorem prover.
• Genetic and hybrid algorithms for graph coloring
• Planning as satisfiability: parallel plans and algorithms for plan search
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae
• Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves
• Parameterizing above Guaranteed Values: MaxSat and MaxCut
• A generalized kinematic modeling method for modular robots
• Theory and Applications of Satisfiability Testing
• Logics in Artificial Intelligence
• A machine program for theorem-proving
• Principles and Practice of Constraint Programming – CP 2004

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