armarx::navigation::algorithms::spfa Namespace Reference

This file is part of ArmarX. More...

Classes
class	ShortestPathFasterAlgorithm

Functions
std::optional< ShortestPathFasterAlgorithm::ClosestReachableResult >	findClosestReachablePosition (const ShortestPathFasterAlgorithm::Result &spfaResult, const Eigen::Vector2f &goal, const Costmap &costmap)

Detailed Description

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

2022

Copyright

http://www.gnu.org/licenses/gpl-2.0.txt GNU General Public License

Function Documentation

findClosestReachablePosition()

std::optional< ShortestPathFasterAlgorithm::ClosestReachableResult > findClosestReachablePosition	(	const ShortestPathFasterAlgorithm::Result &	spfaResult,
		const Eigen::Vector2f &	goal,
		const Costmap &	costmap )

Definition at line 389 of file ShortestPathFasterAlgorithm.cpp.

Here is the caller graph for this function: