Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 機械工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22536
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor羅仁權(Ren-Chuan Luo)
dc.contributor.authorShih-Chiang Wuen
dc.contributor.author吳士強zh_TW
dc.date.accessioned2021-06-08T04:20:12Z-
dc.date.copyright2010-07-21
dc.date.issued2010
dc.date.submitted2010-07-20
dc.identifier.citation[1] A. Chakravarthy and D. Ghose, “Obstacle avoidance in dynamic environment: A collision cone approach,” IEEE Trans. Syst., Man Cybern. A, Syst., Humans, vol. 28, no. 5, pp. 562–574, Sep. 1998.
[2] F. Belkhouche, “Reactive Path Planning in a Dynamic Environment”, IEEE Transactions on Robotics, Vol. 25, no. 4, August 2009.
[3] J. Canny and J. Reif, B. “New lower bound techniques for robot motion planning problems. “ In 28th IEEE Symposium on Foundation of Computer Science, 1987.
[4] 28. J. Reif and M. Sharir. Motion planning in the presence of moving obstacles. In 25th IEEE Symposium on the Foundation of Computer Science, pages 53-144, 1985.
[5] M. Erdmann and T. Lozano-Perez. On multiple moving objects. IEEE International Conference on Robotics and Automation, pages 1419-1424, San Francisco, CA, April 7-101986.
[6] K. Kant and S.W.Zucker. Towards efficient trajectory Planning: the path-velocity decomposition. The International Journal of Robotic Research, 5(3):72-89, Fall 1986.
[7] K. Fujimura and H. Samet. Time-minimal paths among moving obstacles. In IEEE International Conference on Robotics and Automation, pages 1110-1115, Scottsdale, AZ, May 1989.
[8] M. Erdmann and T. Lozano-Perez. On multiple moving objects. Algorithmica, (2):477-521, 1987.
[9] T. Lozano-Perez. Spatial planning: a configuration space approach. IEEE Transaction on Computers, C-32(2):108-120, February 1983.
[10] T. Lozano-Perez. A simple motion planning algorithm for general robot manipulators. IEEE Journal of Robotics and Automation, RA-3(3):224- 238, June 1987.
[11] T. Lozano-Perez and M. A. Wesley. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM, 22(10):560–570, October 1979.
[12] K. Kant and S.W. Zucker. Planning collision free trajectories in time-varying environments: a two level hierarchy, In IEEE International Conference on Robotics and Automation, pages 1644-1649, Raleigh, NC, 1988.
[13] B.H. Lee and C.S.G. Lee. Collision-free motion planning; of two robots. IEEE Transactions on System Man and Cybernetics, SNC-17(1):21-32, January-February 1987.
[14] J. Canny, J. Reif, B. Donald, and P. Xavier. On the complexity of kinodynamic planning. In 29th IEEE Symposium on Foundation of Computer Science, 1988.
[15] C. O'Dunlaing. Motion planning with inertial constraints, Technical Report TR-230, NYU Robotics Laboratory, 1986.
[16] V. Hayward, S. Aubry, A. Foisy, and Y. Ghallab. Efficient collision prediction among m any moving obstacles. International Journal of Robotics Research, 14(2): 129-143, April 1995.
[17] J.C.Sanborn and J.A.Bendler. A model of reaction for planning in dynamic environments. International Journal of Artificial Intelligence in Engineering, 3(2):95-1 01, April 1988.
[18] Hall, E. T. (1959). The Silent Language, Fawcett, Greenwich, Conn.
[19] Hall, E. T. (1966). The Hidden Dimension, Doubleday, New York.
[20] D. Chen, J. Yang, and H. D. Wactlar, “Towards automatic analysis of social interaction patterns in a nursing home environment from video, in 6th ACM SIGMM International Workshop on Multimedia Information Retrieval, vol. Proc. of ACM Multi Media 2004, New York, NY, October 2004, pp. 283–290.
[21] Q. Li, M. De Rosa, and D. Rus, “Distributed algorithms for guiding navigation across a sensor network,” in Proceedings of the 9th annual international conference on Mobile computing and networking. 2003, pp. 313-325, ACM Press.
[22] A. Verma, H. Sawant and J. Tan, “Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network,” 3rd IEEE International Conference on Pervasive Computing and Communications, 2005. 8-12 March 2005 pp. 41 – 50.
[23] K. J. O'Hara and T. J. Balch, “Distributed path planning for robots in dynamic environments using a pervasive embedded network,” in AAMAS, July 2004, pp. 1538-1539.
[24] M. A. Batalin and G. S. Sukhatme, “Coverage, exploration and deployment by a mobile robot and communication network,” Telecommunication Systems, vol. 26, no. 2-4, pp. 181-196, August 2004.
[25] M. A. Batalin and G. S. Sukhatme, “Sensor network-based multi-robot task allocation,” in Proceedings of IEEE/RSJ International Conference On Intelligent Robots and Systems, October 2003.
[26] N. Mitsunaga, T. Izumi, M. Asada, “Cooperative behavior based on a subjective map with shared information in a dynamic environment,” Proceedings of 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Vol.1, pp.291-296.
[27] M. Yamamoto, Y. Isshiki, and A. Mohri, “Collision free minimum time trajectory planning for manipulators using global search and gradient method,” Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems, Vol.3, 12-16 Sept. 1994, pp.2184-2191.
[28] P. Pignon, T. Hasegawa, and J. Laumond, “Optimal obstacle growing in motion planning for mobile robots,” Proceedings IROS '91. IEEE/RSJ International Workshop on Intelligent Robots and Systems, Vol.2, 3-5 Nov. 1991, pp.602 – 607.
[29] O. Khatib., “Real-time obstacle avoidance for robot manipulator and mobile robots.”, The International Journal of Robotics Research, 5(1):90-98, 1986.
[30] J. Chuang and N. Ahuja, “An analytically tractable potential field model of free space and its application in obstacle avoidance,” IEEE Trans. Syst.,Man, Cybern. B, Cybern., vol. 28, no. 5, pp. 729–736, Oct. 1998.
[31] K. P. Valavanis, T. Hebert, R. Kolluru, and N. Tsourveloudis, “Mobile robot navigation in 2-d dynamic environments using an electrostatic potential field,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 30, no. 2, pp. 187–196, Mar. 2000.
[32] “VIA- EPIA-N700 Nano-ITX introduction”, http://www.via.com.tw/en/index.jsp
[33] http://www.aroboto.com/shop/index.php
[34] R. Siegwart and I. Nourbakhsh, ”Introduction to Autonomous Mobile Robots”
[35] Ren C. Luo, Nai W. Chang, Shih C. Lin and Shih C. Wu, “Human Tracking and Following Using Sensor Fusion Approach for Mobile Assistive Companion Robot,” Preprint submitted to The 35th Annual Conference of the IEEE Industrial Electronics Society. Received July 17, 2009
[36] J. Canny. “The Complexity of Robot Motion Planning.”, MIT Press, Boston, MA, 1988.
[37] L. E. Dubins, “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents”, American Journal of Mathematic, Vol. 79, pp. 497-516, 1957.
[38] H. Hu and M. Brady.” A bayesian approach to real-time obstacle avoidance for a mobile robot,” in Autonomous Robots, volume 1, pages 69-92. Kluwer Academic Publishers, Boston, 1994.
[39] M. Khatib and R. Chatila. “An extended potential _eld approach for mobile robot sensor-based motions,” in Proc. International Conference on Intelligent Autonomous Systems (IAS'4), 1995.
[40] D. Fox, W. Burgard, S. Thrun, “The dynamic window approach to collision avoidance”, Robotics & Automation Magazine, IEEE, Vol. 4, No. 1. (1997), pp. 23-33.
[41] A. M. Shkel and V. J. Lumelsky, “Classification of the Dubins set, ” Robotics and Autonomous Systems, vol. 34, pp. 179–202, 2001.
[42] F. Belkhouche and B. Belkhouche, “Modeling and controlling a robotic convoy using guidance law strategies”, IEEE Trans. on Syst., Man, Cybern. B, Cybern., Vol. 35, no. 4, pp. 813-825, Aug. 2005.
[43] E. Rimon and D. E. Kopditcchek, “Exact robot navigation using artificial potential functions, IEEE Trans.”, Robotics Automat. 8, 501-517(1992)
[44] F.Belkhouche, “Nonholonomic robots navigation using linear navigation functions,” in Proc. Amer. Control Conf., New York, Jul. 2007, pp. 5328-5332.
[45] F. Belkhouche and B. Belkhouche, “Wheeled mobile robot navigation using the proportional navigation”, Advanced Robotics, Volume 21, Number 3-4, 2007, pp.395-520.
[46] J. A. Reeds and L. A. Sheep, “Optimal paths for a car that goes both forwards and backwards”, Pacific Journal of Mathematics, Vol. 145, pp. 367-393, 1990
[47] F. Belkhouche, T. Jin, and C. Sung, “Plane collision course detection between moving objects by transformation of coordinates,” in Proc. IEEE Multi-Conf. Syst. Control, San Antonio, TX, Sep. 2008, pp. 1013–1018.
[48] http://www.hagisonic.com/english_pro/pro17.php
[49] http://research.microsoft.com/easyliving/
[50] P. Bahl and V. Padmanabhan, “RADAR: An In-Building RF-based User Location and Tracking system,” Proc. IEEE Infocom 2000, IEEE CS Press, pp. 774-748, 2000.
[51] N. Patwari, ; J.N. Ash, ; S. Kyperountas, ; A.O. Hero, III; R.L. Moses, ; N.S. Correal, “Locating the nodes: cooperative localization in wireless sensor networks,” Signal Processing Magazine, IEEE Volume 22, Issue 4, July 2005 Page(s):54 – 69.
[52] B.D. Van Veen and K.M. Buckley, “Beamforming: A versatile approach to spatial filtering,” IEEE ASSP Mag., vol. 5, no. 2, pp. 4–24, Apr. 1988.
[53] B. Ottersten, M. Viberg, P. Stoica, and A. Nehorai, “Exact and large sample ML techniques for parameter estimation and detection in array processing,” in Radar Array Processing, S.S. Haykin, J. Litva, and T. Shepherd, Eds. New York: Springer-Verlag, 1993, pp. 99–151.
[54] P. Stoica and R.L. Moses, Introduction to Spectral Analysis. Englewood Cliffs, NJ: Prentice-Hall, 1997.
[55] J. Latvala, J. Syrjarinne, H. Ikonen, and J. Niittylahti, “Evaluation of RSSI-based human tracking,” in Proc. 2000 European Signal Processing Conf., vol. 4, pp. 2273-2276, Sept. 2000
[56] Q. Li, M. De Rosa, and D. Rus, “Distributed algorithms for guiding navigation across a sensor network,” in Proceedings of the 9th annual international conference on Mobile computing and networking. 2003, pp. 313-325, ACM Press.
[57] A. Verma, H. Sawant and J. Tan, “Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network,” 3rd IEEE International Conference on Pervasive Computing and Communications, 2005. 8-12 March 2005 pp. 41 – 50.
[58] K. J. O'Hara and T. J. Balch, “Distributed path planning for robots in dynamic environments using a pervasive embedded network,” in AAMAS, July 2004, pp. 1538-1539.
[59] M. A. Batalin and G. S. Sukhatme, “Coverage, exploration and deployment by a mobile robot and communication network,” Telecommunication Systems, vol. 26, no. 2-4, pp. 181-196, August 2004.
[60] M. A. Batalin and G. S. Sukhatme, “Sensor network-based multi-robot task allocation,” in Proceedings of IEEE/RSJ International Conference On Intelligent Robots and Systems, October 2003.
[61] C. W. Warren, “Fast path planning method using modified A* method,” in. IEEE International Conference on Robotics and Automation, pp662-667.
[62] J. Holland, Adaptation in natural and artificial systems. Ann Arbor University of Michigan Press, 1975.
[63] L. D. (Editor), Genetic algorithms and siniulated annealing. Los Altos, California: Morgan Kaufman Publishers, 1987.
[64] Z. Michalewicz, Genetic algorithms + Data structures = Evolution programs, 2nd extended edition. Springer-Verlag. 1994.
[65] K. Sugihara and J. Smith, “Genetic algorithms for adaptive motion planning of an autonomous mobile robot,” in Proc. of IEEE Intl. Symposium on Computational Intelligence in Robotics and Automation, 7 1997, pp. 138-143.
[66] N. Mitsunaga, T. Izumi, M. Asada, “Cooperative behavior based on a subjective map with shared information in a dynamic environment,” Proceedings of 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Vol.1, pp.291-296.
[67] N. Sadati, and J. Taheri, “Solving Robot Motion Planning Problem Using Hopfield Neural Network In A Fuzzified Environment,” Proceedings of the 2002 IEEE International Conference on Fuzzy System, Vol.2, pp. 1144-1149.
[68] M. Yamamoto, Y. Isshiki, and A. Mohri, “Collision free minimum time trajectory planning for manipulators using global search and gradient method,” Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems, Vol.3, 12-16 Sept. 1994, pp.2184-2191.
[69] P. Pignon, T. Hasegawa, and J. Laumond, “Optimal obstacle growing in motion planning for mobile robots,” Proceedings IROS '91. IEEE/RSJ International Workshop on Intelligent Robots and Systems, Vol.2, 3-5 Nov. 1991, pp.602 – 607.
[70] O. Khatib, “Real-time obstacle avoidance for manipulators and mobile robots,” Int. J. Rob. Res., vol. 5, no. 1, pp. 90–98, 1986.
[71] J. Chuang and N. Ahuja, “An analytically tractable potential field model of free space and its application in obstacle avoidance,” IEEE Trans. Syst.,Man, Cybern. B, Cybern., vol. 28, no. 5, pp. 729–736, Oct. 1998.
[72] K. P. Valavanis, T. Hebert, R. Kolluru, and N. Tsourveloudis, “Mobile robot navigation in 2-d dynamic environments using an electrostatic potential field,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 30, no. 2, pp. 187–196, Mar. 2000.
[73] http://www.viatech.com.tw/
[74] http://www.hwkitchen.com/products/uartsb-v2-2-a-much-more-powerful-usb-to-serial-converter/
[75] Y. Kanayama, “A Path/Motion Description Method and Its Application to Mobile Robot Language Design”, Technical Report of Department of Computer Science at University of California at Santa Barbara, Feb. 1989.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/22536-
dc.description.abstract當居家服務型機器人提供服務時,一般會先對環境進行感測,透過感測器的使用,偵測環境的情況再進行運動策略。早期文獻研究主要集中於靜態的環境,環境結構固定,無移動之物體,機器人藉由感測器感知之資料來進行自我定位與建立環境地圖,並規劃路徑,使機器人避免碰撞到達目的地。近年來,由於科技技術的演進,許多學者逐漸開始討論動態環境下機器人的移動規劃。動態環境本身具相當之挑戰性,感測器的效能、運算速度要求高,再者動態環境中移動物體之辨認、追蹤、碰撞預測與避障策略的設計,都相對在靜態環境下有較嚴苛的挑戰。
本篇論文透過運動學的方法來探討機器人與真實動態環境的互動關係,擬欲開發能依據不同的駕駛習慣來調變機器人與真實環境之間的互動模式。一般來說,避開障礙物主要透過幾種方式:一、維持定速,改變方向。藉由方向的調整避免產生碰撞。二、方向不變,改變速度,在原定的路徑上加減速,先一步通過預定路徑或待對方通過而避開碰撞。三、同時改變方向與速度。此一方式較上述兩者較為高級也相對於複雜。於此,本篇論文旨在探討機器人在維持原速度的條件下,根據環境中的運動模型預測,提出尋找免於碰撞的中繼姿態(via-postures)的方法。利用這些中繼姿態產生數條與原路徑接合之滑順路徑,最後經由不同權重函數的參數分析比較,遴選出符合期待的路徑,使機器人在移動過程中避開碰撞,完成任務,抵達目的地。
藉由MATLAB軟體工具的使用,進一步印證我們所提出演算法之合理性與適用性,同時也對不同權重參數所產生之效果進行分析比較,使該演算法能根據不同參數的調變,由函數權重的設置挑選出符合預期之路徑。於此同時,亦設計情境,結合實際硬體的使用,進行實作展示。經由理論的推導到軟體的演算法開發與實務硬體之操作,最後於結論中歸納出研究之成果與討論且提出未來待開發及發展之處。
zh_TW
dc.description.abstractThese years, the applications of robot have become more and more prosperous. Robot become one part in our lives gradually, they may be companions in the future. This thesis attempts to handle the problems of the obstacle avoidance in dynamic environment. In indoor environment, there always exist moving objects those may be people or other service robots. For indoor service robot, it is fundamental and essential to achieve the destination without collision.
In the thesis, we develop the collision-free algorithm by using the mobile robot kinematics. From the point of view, the relative relations are formulated and the collision is predicted. Here, we propose the collision-free conditions to find out proper via-postures. While the condition is satisfied, the relative distance between the robot and the moving obstacle will be guaranteed so that the collision also disappears and via-postures are derived from the condition. To plan a new and smooth path to substitute the original one, a novel path planner is introduced. A smooth path is generated with two given postures. By using the path planner, the robot redirect to the original route to continue to move.
Simulation of the algorithm is made to exam the properties of the algorithm. Simulation and experiment are both conducted to verify the approach. In the scenario, the robot follows the route and there are a man and a robot move straightly across the route. Robot will detour a new path if collision is detected and be redirected to the previous route after the risk of the collision vanishes. About the experiment, a scenario is designed to demonstrate, the webcam is set overhead to capture the information of the robot and the moving objects. All the information is computed on the host server to do the prediction. And the host server sends the commands to control the robot to be collision-free.
The scenario demonstrations are conducted to extend the simulations into reality. It demonstrates the applicability of the approach. Finally, conclusions come out and the future works are listed to improve and develop the approach.
en
dc.description.provenanceMade available in DSpace on 2021-06-08T04:20:12Z (GMT). No. of bitstreams: 1
ntu-99-R96543041-1.pdf: 7219758 bytes, checksum: 8e59a2f76beecb29bdfdda4e08be7a81 (MD5)
Previous issue date: 2010
en
dc.description.tableofcontents致謝 II
中文摘要 IV
ABSTRACT VI
TABLE OF CONTENTS VIII
LIST OF FIGURES X
LIST OF TABLES XIII
CHAPTER 1. INTRODUCTION 1
1.1 Motivation 1
1.2 Objectives 3
1.3 Thesis Organization 6
CHAPTER 2. LITERATURE REVIEW 8
2.1 Mobile Robot Kinematic 8
2.2 Dynamic Motion Planning 10
CHAPTER 3. COLLISION AVOIDANCE 14
3.1 Problem Statement 14
3.2 Related Works 15
3.2.1 Kinematic Equations and Geometry 15
3.2.2 Virtual Plane 16
3.3 Collision-Free Condition 20
3.4 Proxemics 23
CHAPTER 4. DETOUR SOLUTION 25
4.1 Related Works 25
4.1.1 Vertex Graph Method 25
4.1.2 Cell Decomposition 26
4.1.3 Potential Field Method 27
4.2 Via-posture Search 28
4.3 Motion Planning 34
4.3.1 Continuous-curvature smooth path 35
4.3.2 Path Representation 40
4.3.3 Symmetric-Postures Cases 41
4.3.4 Non-Symmetric-Postures Cases 42
4.2.4.1. Parallel-Postures Cases 44
4.2.4.2. Non-Parallel Cases 45
4.4 Path Tracking 46
4.5 Path Selection Based on Detour Behavior Parameters 47
CHAPTER 5. MOBILE ROBOT PLATFORM AND EXPERIMENTAL SETUP 50
5.1 Introduction 50
5.2 Hardware Structure of Robot 51
5.2.1 Kinematics Control 58
5.3 Camera Specification and Model 60
5.3.1 Camera Perspective Model 61
5.4 Image Processing 66
5.5 Wireless Communication 68
CHAPTER 6. SIMULATIONS AND EXPERIMENTAL RESULTS 71
6.1 Algorithm Examination 71
6.2 Scenario Simulation 81
6.3 Scenario Demonstration 85
CHAPTER 7. CONCLUSIONS AND FUTURE WORKS 93
7.1 Conclusions 93
7.2 Future Works 94
REFERENCES 96
VITA 102
dc.language.isoen
dc.subject路徑追蹤zh_TW
dc.subject動態避障zh_TW
dc.subject中繼姿態zh_TW
dc.subject平滑路徑zh_TW
dc.subject路徑規劃zh_TW
dc.subject路徑挑選zh_TW
dc.subjectPath Planningen
dc.subjectPath Trackingen
dc.subjectAutonomous Mobile Roboten
dc.subjectDynamic Obstacle Avoidanceen
dc.subjectSmooth Pathen
dc.title基於運動學之全自主機器人動態運動規劃系統zh_TW
dc.titleKinematics-based Autonomous Mobile Robot Dynamic Motion Planning Systemen
dc.typeThesis
dc.date.schoolyear98-2
dc.description.degree碩士
dc.contributor.coadvisor黃漢邦(Han-Pang Huang)
dc.contributor.oralexamcommittee鄒杰烔(Chieh-Tung Tsou)
dc.subject.keyword動態避障,中繼姿態,平滑路徑,路徑規劃,路徑挑選,路徑追蹤,zh_TW
dc.subject.keywordAutonomous Mobile Robot,Dynamic Obstacle Avoidance,Smooth Path,Path Planning,Path Tracking,en
dc.relation.page102
dc.rights.note未授權
dc.date.accepted2010-07-20
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept機械工程學研究所zh_TW
顯示於系所單位:機械工程學系

文件中的檔案:
檔案 大小格式 
ntu-99-1.pdf
  未授權公開取用
7.05 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved