Filters








5,348 Hits in 5.5 sec

Exploring Complicated Search Spaces with Interleaving-Free Sampling [article]

Yunjie Tian, Lingxi Xie, Jiemin Fang, Jianbin Jiao, Qixiang Ye, Qi Tian
2021 arXiv   pre-print
In this paper, we build the search algorithm upon a complicated search space with long-distance connections, and show that existing weight-sharing search algorithms mostly fail due to the existence of  ...  We argue that such designs, though safe and stable, obstacles the search algorithms from exploring more complicated scenarios.  ...  Exploring Complicated Search Spaces with Interleaving-Free Sampling Yunjie Tian1 , Lingxi  ... 
arXiv:2112.02488v1 fatcat:impwnx22snah3czqhqfbz6cvgu

Heuristics for model checking Java programs

Alex Groce, Willem Visser
2004 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper we present an array of heuristic model checking techniques for combating the state space explosion when searching for errors.  ...  Some techniques for dealing with the most crucial problem in model checking, the state space explosion problem, concentrate on the first of these goals.  ...  fewest nondeterministic choice statements enabled, i.e. allowing the choose-free state space to be searched first but continuing to the rest of the state space otherwise (this also allows choose-free  ... 
doi:10.1007/s10009-003-0130-9 fatcat:azqzw44fezg6lfcee3zow4rr4e

A Survey on Create a Structured Building Models from Silhouette Buildings

Sruthi Satheesh P S
2021 International Journal for Research in Applied Science and Engineering Technology  
Finally update the free-space points. Add new free-space points. Then, at that point, eliminate the free-space point that cover with the recently blended components.  ...  If any of the elements in the exemplar neighborhood overlap with a free-space point, then copy the elements to the output.  ... 
doi:10.22214/ijraset.2021.35193 fatcat:pgjgf5jvrzhjhjurmvvdeymzne

Task space motion planning using reactive control

Matthias Behnisch, Robert Haschke, Michael Gienger
2010 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems  
We combine classical sampling-based random tree planning with a reactive controller connecting sampling points with nontrivial trajectories, utilizing redundant DOFs to locally avoid obstacles.  ...  Additionally, planning is done in a low-dimensional task space instead of the high-dimensional joint space.  ...  ACKNOWLEDGMENTS Matthias Behnisch gratefully acknowledges the financial support from Honda Research Institute Europe for the project "Sampling-based planning for goal directed robot control".  ... 
doi:10.1109/iros.2010.5651285 dblp:conf/iros/BehnischHG10 fatcat:3svjqhzmdrcyhiaewphnisskya

Evaluating aggregated search using interleaving

Aleksandr Chuklin, Anne Schuth, Katja Hofmann, Pavel Serdyukov, Maarten de Rijke
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
A result page of a modern web search engine is often much more complicated than a simple list of "ten blue links."  ...  All this makes our proposed interleaving algorithm an essential tool for comparing IR systems with complex aggregated pages.  ...  Accuracy is as high as under TDI, with only small losses in e ciency for small sample sizes.  ... 
doi:10.1145/2505515.2505698 dblp:conf/cikm/ChuklinSHSR13 fatcat:xpd5elvxvncllcygw7v67xwmwy

Adaptive retrospective correction of motion artifacts in cranial MRI with multicoil three-dimensional radial acquisitions

Ashley G. Anderson, Julia Velikina, Walter Block, Oliver Wieben, Alexey Samsonov
2012 Magnetic Resonance in Medicine  
Despite reduction in imaging times through improved hardware and rapid acquisition schemes, motion artifacts can compromise image quality in magnetic resonance imaging, especially in 3D imaging with its  ...  Direct extension of most state-of-the-art 2D rigid body motion compensation techniques to the 3D case is often challenging or impractical due to a significant increase in sampling requirements.  ...  However, a straightforward extension of PROPELLER to 3D for full rigid body motion correction is significantly complicated by a large increase in data sampling requirements.  ... 
doi:10.1002/mrm.24348 pmid:22760728 pmcid:PMC4226397 fatcat:obbmzzfqr5a27ocbrdzzwzdo34

Multiparameter Persistence Landscapes [article]

Oliver Vipond
2018 arXiv   pre-print
We show that multiparameter landscapes are stable with respect to the interleaving distance and persistence weighted Wasserstein distance, and that the collection of multiparameter landscapes faithfully  ...  An important problem in the field of Topological Data Analysis is defining topological summaries which can be combined with traditional data analytic tools.  ...  The author wishes to thank his supervisor Ulrike Tillmann for her guidance and support with this project, and Peter Bubenik for helpful suggestions.  ... 
arXiv:1812.09935v1 fatcat:ulkicrcv75hqvoaefgbmwqkzt4

AM-RRT*: Informed Sampling-based Planning with Assisting Metric [article]

Daniel Armstrong, André Jonasson
2021 arXiv   pre-print
Our method extends RRT-based sampling methods to enable the use of an assisting distance metric to improve performance in environments with obstacles.  ...  Sampling-based approaches often perform poorly in environments with narrow passages, a feature common to many indoor applications of mobile robots as well as computer games.  ...  They incrementally construct a tree representation of the environment by sampling points in the free space and connecting them along collision-free edges to a nearby node in the tree.  ... 
arXiv:2010.14693v2 fatcat:5yszb7gdrbdj3iphqr4bm6n5hy

Toward interactive search in remote sensing imagery

Reid Porter, Don Hush, Neal Harvey, James Theiler, John F. Buford, Gabriel Jakobson, John Erickson, William J. Tolone, William Ribarsky
2010 Cyber Security, Situation Management, and Impact Assessment II; and Visual Analytics for Homeland Defense and Security II  
We conclude by describing an application in broad-area search of remote sensing imagery.  ...  We describe a new design criteria for this problem, and present comparisons to existing techniques with both synthetic and real-world datasets .  ...  Both Interleave and HighPass methods require the selection of free parameters.  ... 
doi:10.1117/12.850787 fatcat:gdbtc5fhiffjldoqa5ejdfyaju

Multiple-coil k -space interpolation enhances resolution in single-shot spatiotemporal MRI

Gilad Liberman, Eddy Solomon, Michael Lustig, Lucio Frydman
2017 Magnetic Resonance in Medicine  
Methods: By casting SPEN's spatial rasterization in k-space, it becomes evident that local k-data interpolations enabled by multiple receivers are akin to real-space interleaving of SPEN images.  ...  Purpose: Spatio-temporal encoding (SPEN) experiments can deliver single-scan MR images without folding complications and with robustness to chemical shift and susceptibility artifacts.  ...  The direct-space sampling nature of SPEN, however, implies that despite its low-bandwidth undersampling, all its pre-processed images are free from folding effects.  ... 
doi:10.1002/mrm.26731 pmid:28556180 fatcat:fovtr4vmwjetbcspt47tu3zsey

Scalable Parallel Algorithms for FPT Problems

Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons
2006 Algorithmica  
The importance of maintaining a balanced decomposition of the search space is shown to be critical to achieving scalability. Target problems need only be amenable to reduction and decomposition.  ...  Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance.  ...  Acknowledgments We are grateful to Mike Fellows and Fran Rosamond for their collaboration and encouragement, to Bill Cook for providing us with the streamlined linear programming routines we employed in  ... 
doi:10.1007/s00453-006-1214-1 fatcat:vzmvskuvtba6veze7o7ekbntii

A Survey of Asymptotically Optimal Sampling-based Motion Planning Methods [article]

Jonathan D. Gammell, Marlin P. Strub
2020 arXiv   pre-print
Formal path-quality guarantees for continuously valued search spaces are an active area of research interest.  ...  Recent results have proven that some sampling-based planning methods probabilistically converge towards the optimal solution as computational effort approaches infinity.  ...  Lazy Search. Sampling-based planning algorithms search problems by sampling the free subspace and connecting samples with edges.  ... 
arXiv:2009.10484v1 fatcat:idhjoeu3snhljmmhvhodqd4cca

Interleaving planning and control for efficient haptically-guided reaching in unknown environments

Daehyung Park, Ariel Kapusta, Jeffrey Hawke, Charles C. Kemp
2014 2014 IEEE-RAS International Conference on Humanoid Robots  
HIPC runs two planning methods, interleaving a task-space and a joint-space planner, to provide fast reaching performance.  ...  In this paper, we propose a haptically-guided interleaving planning and control (HIPC) method with a haptic mapping framework.  ...  CONCLUSION We have introduced our haptically-guided interleaving planning and control framework (HIPC), which interleaves a task-space planner and controller with a joint-space planner and controller that  ... 
doi:10.1109/humanoids.2014.7041456 dblp:conf/humanoids/ParkKHK14 fatcat:x56i5nm75bhvnnxvtv4ajotobe

Batch Belief Trees for Motion Planning Under Uncertainty [article]

Dongliang Zheng, Panagiotis Tsiotras
2021 arXiv   pre-print
The algorithm interleaves between batch sampling, building a graph of nominal trajectories in the state space, and searching over the graph to find belief space motion plans.  ...  Instead of an exhaustive search (exploitation) after one exploration step, the proposed algorithm uses batch samples to explore the state space and also does not require exhaustive search before the next  ...  The state-space X is decomposed into free space X free and obstacle space X obs .  ... 
arXiv:2110.00173v1 fatcat:c7urpkswhzdyjohkvzto7uug7m

A General Manipulation Task Planner [chapter]

Thierry Siméon, Juan Cortés, Anis Sahbani, Jean-Paul Laumond
2004 Springer Tracts in Advanced Robotics  
This property leads to reduce the problem by structuring the search-space.  ...  Experiments conducted with the planner demonstrate its efficacy to solve complex manipulation problems.  ...  Continuous Case The structure of the search space is more complex when dealing with continuous sets P and G.  ... 
doi:10.1007/978-3-540-45058-0_19 fatcat:vm3intjzqvg6dleabaigodye3y
« Previous Showing results 1 — 15 out of 5,348 results