Investigation of a target reachability by a manipulator in an unknown environment
Pavel Lopatin · 2016
An algorithm for a n-link manipulator movement amidst arbitrary unknown static obstacles is presented. Given a theorem stating that if the manipulator moves according to the algorithm it will discover in a finite number of steps whether a given target configuration is reachable or not. The number, shapes and dispositions of obstacles may be arbitrary.