/* Copyright (c) 2010-2016, Mathieu Labbe - IntRoLab - Universite de Sherbrooke 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 Universite de Sherbrooke 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 HOLDER 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. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace rtabmap; void showUsage() { printf("\nUsage:\n" "rtabmap-detectMoreLoopClosures [options] database.db\n" "Options:\n" " -r # Cluster radius (default 1 m).\n" " -rx # Cluster radius min (default 0 m).\n" " -a # Cluster angle (default 30 deg).\n" " -i # Iterations (default 1).\n" " --intra Add only intra-session loop closures.\n" " --inter Add only inter-session loop closures.\n" " --session # Add loop closures only from/to that map session ID (use -1 for last session).\n" "\n%s", Parameters::showUsage()); exit(1); } bool g_loopForever = true; class PrintProgressState : public ProgressState { public: PrintProgressState() : stamp_(UTimer::now()) {} virtual bool callback(const std::string & msg) const { if(!msg.empty()) printf("[%f] %s \n", UTimer::now()-stamp_, msg.c_str()); return g_loopForever; } private: double stamp_; }; PrintProgressState progress; // catch ctrl-c void sighandler(int sig) { printf("\nSignal %d caught...\n", sig); g_loopForever = false; progress.setCanceled(true); } int main(int argc, char * argv[]) { signal(SIGABRT, &sighandler); signal(SIGTERM, &sighandler); signal(SIGINT, &sighandler); ULogger::setType(ULogger::kTypeConsole); ULogger::setLevel(ULogger::kWarning); if(argc < 2) { showUsage(); } float clusterRadiusMin = 0.0f; float clusterRadiusMax = 1.0f; float clusterAngle = CV_PI/6.0f; int iterations = 1; bool intraSession = false; bool interSession = false; int fromToMapId = -2; for(int i=1; iopenConnection(dbPath)) { parameters = driver->getLastParameters(); driver->closeConnection(false); } else { UERROR("Cannot open database %s!", dbPath.c_str()); } delete driver; for(ParametersMap::iterator iter=inputParams.begin(); iter!=inputParams.end(); ++iter) { printf(" Using parameter \"%s=%s\" from arguments\n", iter->first.c_str(), iter->second.c_str()); } // Get the global optimized map Rtabmap rtabmap; printf("Initialization...\n"); UTimer timer; ParametersMap originalParameters = parameters; uInsert(parameters, inputParams); // This avoids to load original descriptors in the dictionary // to save RAM and intialization time (we don't need the dictionary for this tool) rtabmap.setDummyDictionary(true); // should be set before Rtabmap::init() rtabmap.init(parameters, dbPath); printf("Initialization... done! (%f sec)\n", timer.ticks()); // detectMoreLoopClosures would clear the optimized map if loop closures are detected float xMin, yMin, cellSize; bool haveOptimizedMap = !rtabmap.getMemory()->load2DMap(xMin, yMin, cellSize).empty(); if(fromToMapId <= -2) { fromToMapId = -1; // means all below } else { bool last = false; if(fromToMapId == -1) { // get last session ID fromToMapId = rtabmap.getMemory()->getMapId(rtabmap.getMemory()->getLastSignatureId(), true); } printf("From/To Session ID = %d%s\n", fromToMapId, last?" (last session)":""); } printf("Detecting...\n"); int detected = rtabmap.detectMoreLoopClosures(clusterRadiusMax, clusterAngle, iterations, intraSession, interSession, &progress, clusterRadiusMin, fromToMapId); if(detected < 0) { if(!g_loopForever) { printf("Detection interrupted. Loop closures found so far (if any) are not saved.\n"); } else { printf("Loop closure detection failed!\n"); } } else if(detected > 0 && haveOptimizedMap) { printf("The database has a global occupancy grid, regenerating one with new optimized graph!\n"); LocalGridCache cache; OccupancyGrid grid(&cache, parameters); std::map optimizedPoses = rtabmap.getLocalOptimizedPoses(); for(std::map::iterator iter=optimizedPoses.lower_bound(0); iter!=optimizedPoses.end(); ++iter) { SensorData data = rtabmap.getMemory()->getNodeData(iter->first, false, false, false, true); data.uncompressData(); cache.add(iter->first, data.gridGroundCellsRaw(), data.gridObstacleCellsRaw(), data.gridEmptyCellsRaw(), data.gridCellSize(), data.gridViewPoint()); } grid.update(optimizedPoses); cv::Mat map = grid.getMap(xMin, yMin); if(map.empty()) { printf("Could not generate the global occupancy grid!\n"); } else { rtabmap.getMemory()->save2DMap(map, xMin, yMin, cellSize); printf("Save new global occupancy grid!\n"); } } // Restore original parameters before saving back the database rtabmap.parseParameters(originalParameters); rtabmap.close(detected>0); // Only a negative count is a failure (detection failed or was interrupted). // Finding zero new loop closures is a valid outcome, so exit 0. return detected<0?1:0; }