淡江大學機構典藏:Item 987654321/81418
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3947886      Online Users : 688
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/81418


    Title: Safe and Smooth: Mobile Agent Trajectory Smoothing by SVM
    Authors: Yang, Chan-Yun;Yang, Jr-Syu;Lian, Feng-Li
    Contributors: 淡江大學機械與機電工程學系
    Keywords: Path planning;Safe;Smooth;Large margin;Support vector machines
    Date: 2012-07
    Issue Date: 2013-03-11 17:16:08 (UTC+8)
    Publisher: Kumamoto: I C I C International
    Abstract: The paper presents a model merging Voronoi tessellation with an underlying support vector machine (SVM) in order to develop path planning for guiding an autonomous vehicle safely and smoothly through a space with obstacles. Being a roadmap method for path generation, the Voronoi tessellation is employed as a preprocessor to roughly fit a connection between the initial and goal configurations. Though the Voronoi path is safe for obstacle avoidance, its disjoint linear edges are unsatisfactory when smoothness is requested. Hence, an SVM postprocessor is proposed to make the segmented path smoother. By analogue to the Gaussian potential field, a zero-potential curve in the configuration space is thus obtained by the SVM postprocessor and forms a safe and smooth path. Due to advantages of the SVM with RBF kernel, the post-processed path has the merits of both smoothness from the Gaussian kernel basis, and wide clearance from the large-margin decision boundary. This paper adopts point configurations to represent obstacles in the working space. With additional artificial points for auxiliary constraints, the two-stage path planner is then developed. Detailed property investigations and simulated applications are also included to characterize the path planner. The results of a practical demonstration show a promising future for further applications.
    Relation: International Journal of Innovative Computing, Information and Control 8(7)pt.B, pp.4959-4978
    Appears in Collections:[Graduate Institute & Department of Mechanical and Electro-Mechanical Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML331View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback