The site is read-only. Please transition to use Robotics Stack Exchange
| ROS Resources: Documentation | Support | Discussion Forum | Index | Service Status | ros @ Robotics Stack Exchange |
 | 1 | initial version |
From what you describe it's moderately easy to simply publish
I'd recommend that you publish r0 -> r1 as the product of (r0 -> a0) * (a0 -> a1) * (a1 -> r1)
Where (a0 -> a1) might be an identity and can be dropped depending on your system. You can query the other two fields trivially from the existing tf2 trees. And then you'll have both trees connected at the times you consider the leaves attached.
This is a relatively straightforward algorithm that could be implemented in a reusable way parameterized on what root links to join and what the detected bridging/attaching elements are expected to be.
ROS Answers is licensed under Creative Commons Attribution 3.0 Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
