Results 1 to 10 of 11

Thread: automatic path planning for WMRs

Hybrid View

  1. #1

    Default automatic path planning for WMRs

    hi,
    did anyone work on any automatic path planning algoritim for Wheeled Mobile Robots(WMRs)???
    It may include, point to point tracking, obstacle avoidance, parking, and working with moving obstacles n moving targets etc. If anyone is interested in finding a new algorithim for one of the above problems, we can work together.
    Subhasis
    Subhasis Behera
    http://subhasis6.tripod.com
    If you are not living on the EDGE, then you are wasting space...

  2. #2

    Default Path Planning

    Hi i am also doing a project on similar project
    it is Automatic Navigation of a vehicle on a predetermined Track
    I am interested in working with you. waiting 4 ur reply

  3. #3

    Default Updates on Path Planning?

    Hi I also started working on something similar. Any leads on the path planning logic?

    For my project i have make my bot to travel between any two points of many points. Please share your findings.

    Thank you.

  4. #4
    Senior Member Cyborg
    Join Date
    Nov 2006
    Location
    Bangalore, india
    Posts
    244

    Default

    i think you dig a almost half a decade old post , may be these members are inactive now. You can put your bots documentation to give this thread a new life.
    Nikhil Chandra | Bangalore

    Imagination is more important than knowledge.

  5. #5

    Default My idea for this project...

    Hi Shashank, was searching the forum for any relevant projects and found this thread and posted here to avoid the topic being repeated...

    K, here is what i have thought. The idea is not to confine the robot just to maze solving and obstacle less perfect paths but to get it into more real life situations.

    Like in a house for example. My idea is to make the bot a combination of both line following and micro-mouse concepts. There will be a base station which will update the new co-ordinates to the bot and the bot has to acknowledge it back after receiving the new destination.

    The bot processes for the shortest path and after reaching the destination would send out a reached signal to the base station.

    I thought using stepper would be easier for this project. I am still thinking over the shortest-path algorithm... I have wikied for it and found many algorithms...
    http://en.wikipedia.org/wiki/Shortest_path_problem

    So could someone tell me which is the best algorithm for this scenario?
    Thank you.

  6. #6
    Super Moderator T-1000 docel's Avatar
    Join Date
    Sep 2005
    Location
    BANGALORE
    Posts
    1,441
    Blog Entries
    3

    Default

    Hmmm.... something is not clear here !

    Path Planning- How can the 'Base station ' update the Robot of the destination ?
    docel
    ^Anything is possible..
    after YOU prove it!!

    http://bangalorerobotics.tripod.com

  7. #7

    Default

    Hi docel,

    Hmm.. consider two environments where the robot is going to operate:

    1)Simple: Not many rooms and no obstacles and only one robot:
    There would not be much to compute and since there is only one robot, the base station can calculate the least path and just control the bot like a remote-control

    2)A bit complex: There will be many rooms, few obstacles which are moving (like people) and static and may be more than one robot to control in the area(right now i am assuming that we use only one robot).

    There would be many calculations to be done and unknown factors (like moving obstacles) which the base station would not know of..so the base station just updates the robot of its destination through a wireless link and the mobile robot would do the math to get the least path and will wait if necessary for the obstacle to clear its path etc.. basically i wanted to shift the calculation part from the base station to mobile robot.

    Waiting for your comment.

  8. #8
    Super Moderator T-1000 docel's Avatar
    Join Date
    Sep 2005
    Location
    BANGALORE
    Posts
    1,441
    Blog Entries
    3

    Default

    ....you missed my point , my dear!

    case 1: How does the "base" know what to update the Robot with ??

    case 2: How can the Robot calculate the 'least path' ??
    docel
    ^Anything is possible..
    after YOU prove it!!

    http://bangalorerobotics.tripod.com

  9. #9
    Senior Member Android
    Join Date
    Apr 2010
    Location
    Boston, USA
    Posts
    133

    Default

    Sudarshan, Try Dijkstra's algorithm for shortest path. Follow this link. Also find the other shortest path methods given at the end of the page.

    http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •