SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Prorok Kalle) srt2:(2005-2009)"

Sökning: WFRF:(Prorok Kalle) > (2005-2009)

  • Resultat 1-2 av 2
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Georgsson, Fredrik, et al. (författare)
  • Development of an Autonomous Path Tracking Forest Machine : a status report
  • 2005
  • Rapport (övrigt vetenskapligt/konstnärligt)abstract
    • In many respects traditional automation in the forest-machine industry has reached an up- per limit, since the driver already has to deal with an excess of information and take too many decisions at a very high pace. To further automation still, introduction of semi-autonomous and autonomous functions are expected and considered necessary. This paper describes an ongoing project along these ideas. We describe the development of the hardware and software of an unmanned shuttle that shifts timber from the area of felling to the main roads for fur- ther transportation. A new path-tracking algorithm is introduced, and demonstrated as being superior to standard techniques, such as Follow-the-Carrot and Pure-Pursuit. To facilitate the research and development, a comprehensive software architecture for sensor and actuator interfacing is developed. Obstacle avoidance is accomplished by a new kind of radar, developed for and by the automotive industry. Localization is accomplished by a Kalman filter combining data from a Real-Time Kinematic Differential GPS/GLONASS and a gyro/compass. Tests conducted on a simulator and a small-scale robot show promising results. Tests on the real forest machine are ongoing, and will be completed before the end of 2005.
  •  
2.
  • Rönnbäck, Sven, 1970-, et al. (författare)
  • CSE+ : path planning amid circles
  • 2009
  • Ingår i: IEEE International Conference on Robots and Agents. - : IEEE conference proceedings. - 9781424427123 - 9781424427130 ; , s. 447-452
  • Konferensbidrag (refereegranskat)abstract
    • This paper presents a method for obstacle avoidance and path-finding amid circular objects. The input data are circles and the output is a sequence of circles. The output circles represent a possible path, to a target, for a holonomic mobile robot. The method uses a solution to the Apollonius Tangency problem to find the maximum spanning circles amid the input circles. The radii of the circles can be set by desired clearance to nearby obstacles, from sensor parameters, or model parameters from extracted features. The method is intuitive and rather easily implemented and suits well for mobile robots, especially mobile robots with circular shape. It can be implemented with a depth-first approach where the target bearing angle is used as criteria in a divide and conquer step. The method was tested on sensor data registered by a laser range finder.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-2 av 2

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy