|
| void | checkSameSize (const std::vector< Costmap > &costmaps) |
| |
| SceneBounds | computeSceneBounds (const std::vector< Eigen::Vector2f > &points, const SceneBounds &init, const float margin) |
| |
| SceneBounds | computeSceneBounds (const VirtualRobot::SceneObjectSetPtr &obstacles, const std::vector< VirtualRobot::RobotPtr > &articulatedObjects, const SceneBounds &init, const std::vector< Room > &rooms, const float margin, const bool restrictToRooms) |
| |
| orientation_aware::Costmap3D | costmap3dFromAron (const armem::wm::EntityInstance &entityInstance) |
| |
| Costmap | costmapFromAron (const aron::data::DictPtr &dto) |
| |
| Costmap::Mask | dilateMask (const Costmap::Mask &mask, int numIterations) |
| |
| template<typename T, typename Proj> |
| std::vector< T > | filterByRoom (const armarx::navigation::algorithms::Room &room, const std::vector< T > &objects, Proj proj) |
| | Filter a collection of objects by whether their projected position lies inside a room.
|
| |
| Costmap | fromAron (const armem::wm::EntityInstance &entityInstance) |
| |
| void | fromAron (const arondto::Room &dto, Room &bo) |
| |
| void | fromAron (const arondto::ShortestPathFasterAlgorithmParams &dto, spfa::ShortestPathFasterAlgorithm::Parameters &bo) |
| |
| void | invalidateOutsideRooms (const std::vector< Room > &rooms, Costmap &costmap) |
| |
| void | invalidateOutsideRooms (const std::vector< Room > &rooms, orientation_aware::Costmap3D &costmap) |
| |
| Costmap | load (const std::filesystem::path &directory) |
| |
| SceneBounds | merge (const std::vector< SceneBounds > &sceneBounds) |
| |
| Costmap | mergeAligned (const std::vector< Costmap > &costmaps, const std::vector< float > &weights) |
| |
| Costmap | mergeAligned (const std::vector< Costmap > &costmaps, CostmapMergeMode mode) |
| |
| template<class... Ts> |
| | overloaded (Ts...) -> overloaded< Ts... > |
| |
| std::optional< core::Pose2D > | sampleValidPositionInMap (const algorithms::Costmap &costmap) |
| |
| bool | save (const Costmap &costmap, const std::filesystem::path &directory) |
| |
| Costmap | scaleCostmap (const Costmap &costmap, float cellSize) |
| |
| void | toAron (arondto::Room &dto, const Room &bo) |
| |
| void | toAron (arondto::ShortestPathFasterAlgorithmParams &dto, const spfa::ShortestPathFasterAlgorithm::Parameters &bo) |
| |
| template<class DtoT, class BoT> |
| DtoT | toAron (const BoT &bo) |
| |
| armarx::aron::data::DictPtr | toAron (const Costmap &bo) |
| |
| armarx::aron::data::DictPtr | toAron (const orientation_aware::Costmap3D &bo) |
| |
| Costmap | toCostmap (const VirtualRobot::WorkspaceGrid &workspaceGrid) |
| |
| SceneBounds | toSceneBounds (const VirtualRobot::WorkspaceGrid::Extends &extends) |
| |
| void | visualize (const algorithms::Costmap &costmap, viz::Layer &layer, const std::string &name, const float zOffset) |
| |
| void | visualize (const algorithms::orientation_aware::Costmap3D &costmap, std::vector< viz::Layer > &layers, const std::string &name, const float zOffset, bool initializeMask) |
| |
This file is part of ArmarX.
ArmarX is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation.
ArmarX is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
- Author
- Fabian Reister ( fabian dot reister at kit dot edu )
- Date
- 2021
- Copyright
- http://www.gnu.org/licenses/gpl-2.0.txt GNU General Public License
ArmarX is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation.
ArmarX is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
- Author
- Fabian Reister ( fabian dot reister at kit dot edu )
- Date
- 2022
- Copyright
- http://www.gnu.org/licenses/gpl-2.0.txt GNU General Public License
ArmarX is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation.
ArmarX is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
- Author
- Fabian Reister ( fabian dot reister at kit dot edu )
- Date
- 2023
- Copyright
- http://www.gnu.org/licenses/gpl-2.0.txt GNU General Public License
ArmarX is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 2 as published by the Free Software Foundation.
ArmarX is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
- Author
- Fabian Reister ( fabian dot reister at kit dot edu )
- Date
- 2025
- Copyright
- http://www.gnu.org/licenses/gpl-2.0.txt GNU General Public License