shortest_path.h

Go to the documentation of this file.

/*
 * Copyright (c) 2008, Willow Garage, Inc.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the Willow Garage, Inc. nor the names of its
 *       contributors may be used to endorse or promote products derived from
 *       this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *
 */


#ifndef OCCUPANCY_GRID_UTILS_SHORTEST_PATH_H
#define OCCUPANCY_GRID_UTILS_SHORTEST_PATH_H

#include <occupancy_grid_utils/coordinate_conversions.h>
#include <occupancy_grid_utils/NavigationFunction.h>
#include <boost/shared_ptr.hpp>
#include <boost/optional.hpp>
#include <set>

namespace occupancy_grid_utils
{

/************************************************************
 * Obstacle inflation
 ************************************************************/

nav_msgs::OccupancyGrid::Ptr inflateObstacles (const nav_msgs::OccupancyGrid& g, const double r);


/************************************************************
 * Shortest paths
 ************************************************************/

struct ShortestPathResult;
typedef boost::shared_ptr<const ShortestPathResult> ResultPtr;
typedef std::set<Cell> Cells;
typedef std::vector<Cell> Path;
typedef std::pair<Path, double> AStarResult;


struct TerminationCondition
{
  TerminationCondition ();
  TerminationCondition (double max_distance);
  TerminationCondition (const Cells& goals);
  TerminationCondition (const Cells& goals, const double max_distance);

  boost::optional<double> max_distance_;
  boost::optional<std::set<Cell> > goals_;
};

ResultPtr singleSourceShortestPaths (const nav_msgs::OccupancyGrid& g, const Cell& src);


ResultPtr singleSourceShortestPaths (const nav_msgs::OccupancyGrid& g, const Cell& src,
                                     const TerminationCondition& term);

boost::optional<Path> extractPath (ResultPtr shortest_path_result, const Cell& dest);

boost::optional<double> distance(ResultPtr shortest_path_result, const Cell& dest);

ResultPtr shortestPathResultFromMessage (const NavigationFunction& msg);

NavigationFunction shortestPathResultToMessage (ResultPtr res);


boost::optional<AStarResult> shortestPath(const nav_msgs::OccupancyGrid& g,
                                          const Cell& src, const Cell& dest);
} // namespace

#endif // include guard