gradient_path.h
Go to the documentation of this file.
00001 /*********************************************************************
00002  *
00003  * Software License Agreement (BSD License)
00004  *
00005  *  Copyright (c) 2008, 2013, Willow Garage, Inc.
00006  *  All rights reserved.
00007  *
00008  *  Redistribution and use in source and binary forms, with or without
00009  *  modification, are permitted provided that the following conditions
00010  *  are met:
00011  *
00012  *   * Redistributions of source code must retain the above copyright
00013  *     notice, this list of conditions and the following disclaimer.
00014  *   * Redistributions in binary form must reproduce the above
00015  *     copyright notice, this list of conditions and the following
00016  *     disclaimer in the documentation and/or other materials provided
00017  *     with the distribution.
00018  *   * Neither the name of Willow Garage, Inc. nor the names of its
00019  *     contributors may be used to endorse or promote products derived
00020  *     from this software without specific prior written permission.
00021  *
00022  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00023  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
00024  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
00025  *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
00026  *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
00027  *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
00028  *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00029  *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00030  *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00031  *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
00032  *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
00033  *  POSSIBILITY OF SUCH DAMAGE.
00034  *
00035  * Author: Eitan Marder-Eppstein
00036  *         David V. Lu!!
00037  *********************************************************************/
00038 #ifndef _GRADIENT_PATH_H
00039 #define _GRADIENT_PATH_H
00040 
00041 #include<global_planner/traceback.h>
00042 #include <math.h>
00043 
00044 namespace global_planner {
00045 
00046 class GradientPath : public Traceback {
00047     public:
00048         GradientPath(PotentialCalculator* p_calc);
00049         ~GradientPath();
00050 
00051         void setSize(int xs, int ys);
00052 
00053         //
00054         // Path construction
00055         // Find gradient at array points, interpolate path
00056         // Use step size of pathStep, usually 0.5 pixel
00057         //
00058         // Some sanity checks:
00059         //  1. Stuck at same index position
00060         //  2. Doesn't get near goal
00061         //  3. Surrounded by high potentials
00062         //
00063         bool getPath(float* potential, double start_x, double start_y, double end_x, double end_y, std::vector<std::pair<float, float> >& path);
00064     private:
00065         inline int getNearestPoint(int stc, float dx, float dy) {
00066             int pt = stc + (int)round(dx) + (int)(xs_ * round(dy));
00067             return std::max(0, std::min(xs_ * ys_ - 1, pt));
00068         }
00069         float gradCell(float* potential, int n);
00070 
00071         float *gradx_, *grady_; 
00073         float pathStep_; 
00074 };
00075 
00076 } //end namespace global_planner
00077 #endif


global_planner
Author(s): David Lu!!
autogenerated on Wed Aug 2 2017 03:13:12