1,956 research outputs found
Autonomous Sweet Pepper Harvesting for Protected Cropping Systems
In this letter, we present a new robotic harvester (Harvey) that can
autonomously harvest sweet pepper in protected cropping environments. Our
approach combines effective vision algorithms with a novel end-effector design
to enable successful harvesting of sweet peppers. Initial field trials in
protected cropping environments, with two cultivar, demonstrate the efficacy of
this approach achieving a 46% success rate for unmodified crop, and 58% for
modified crop. Furthermore, for the more favourable cultivar we were also able
to detach 90% of sweet peppers, indicating that improvements in the grasping
success rate would result in greatly improved harvesting performance
Evaluation of automated decisionmaking methodologies and development of an integrated robotic system simulation
A generic computer simulation for manipulator systems (ROBSIM) was implemented and the specific technologies necessary to increase the role of automation in various missions were developed. The specific items developed are: (1) capability for definition of a manipulator system consisting of multiple arms, load objects, and an environment; (2) capability for kinematic analysis, requirements analysis, and response simulation of manipulator motion; (3) postprocessing options such as graphic replay of simulated motion and manipulator parameter plotting; (4) investigation and simulation of various control methods including manual force/torque and active compliances control; (5) evaluation and implementation of three obstacle avoidance methods; (6) video simulation and edge detection; and (7) software simulation validation
Multi-agent Collision Avoidance Using Interval Analysis and Symbolic Modelling with its Application to the Novel Polycopter
Coordination is fundamental component of autonomy when a system is defined by multiple mobile agents. For unmanned aerial systems (UAS), challenges originate from their low-level systems, such as their flight dynamics, which are often complex. The thesis begins by examining these low-level dynamics in an analysis of several well known UAS using a novel symbolic component-based framework. It is shown how this approach is used effectively to define key model and performance properties necessary of UAS trajectory control. This is demonstrated initially under the context of linear quadratic regulation (LQR) and model predictive control (MPC) of a quadcopter.
The symbolic framework is later extended in the proposal of a novel UAS platform, referred to as the ``Polycopter" for its morphing nature. This dual-tilt axis system has unique authority over is thrust vector, in addition to an ability to actively augment its stability and aerodynamic characteristics. This presents several opportunities in exploitative control design.
With an approach to low-level UAS modelling and control proposed, the focus of the thesis shifts to investigate the challenges associated with local trajectory generation for the purpose of multi-agent collision avoidance. This begins with a novel survey of the state-of-the-art geometric approaches with respect to performance, scalability and tolerance to uncertainty. From this survey, the interval avoidance (IA) method is proposed, to incorporate trajectory uncertainty in the geometric derivation of escape trajectories. The method is shown to be more effective in ensuring safe separation in several of the presented conditions, however performance is shown to deteriorate in denser conflicts.
Finally, it is shown how by re-framing the IA problem, three dimensional (3D) collision avoidance is achieved. The novel 3D IA method is shown to out perform the original method in three conflict cases by maintaining separation under the effects of uncertainty and in scenarios with multiple obstacles. The performance, scalability and uncertainty tolerance of each presented method is then examined in a set of scenarios resembling typical coordinated UAS operations in an exhaustive Monte-Carlo analysis
Efficient Humanoid Contact Planning using Learned Centroidal Dynamics Prediction
Humanoid robots dynamically navigate an environment by interacting with it
via contact wrenches exerted at intermittent contact poses. Therefore, it is
important to consider dynamics when planning a contact sequence. Traditional
contact planning approaches assume a quasi-static balance criterion to reduce
the computational challenges of selecting a contact sequence over a rough
terrain. This however limits the applicability of the approach when dynamic
motions are required, such as when walking down a steep slope or crossing a
wide gap. Recent methods overcome this limitation with the help of efficient
mixed integer convex programming solvers capable of synthesizing dynamic
contact sequences. Nevertheless, its exponential-time complexity limits its
applicability to short time horizon contact sequences within small
environments. In this paper, we go beyond current approaches by learning a
prediction of the dynamic evolution of the robot centroidal momenta, which can
then be used for quickly generating dynamically robust contact sequences for
robots with arms and legs using a search-based contact planner. We demonstrate
the efficiency and quality of the results of the proposed approach in a set of
dynamically challenging scenarios
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search
Inspection planning, the task of planning motions that allow a robot to
inspect a set of points of interest, has applications in domains such as
industrial, field, and medical robotics. Inspection planning can be
computationally challenging, as the search space over motion plans that inspect
the points of interest grows exponentially with the number of inspected points.
We propose a novel method, Incremental Random Inspection-roadmap Search (IRIS),
that computes inspection plans whose length and set of inspected points
asymptotically converge to those of an optimal inspection plan. IRIS
incrementally densifies a motion planning roadmap using sampling-based
algorithms, and performs efficient near-optimal graph search over the resulting
roadmap as it is generated. We demonstrate IRIS's efficacy on a simulated
planar 5DOF manipulator inspection task and on a medical endoscopic inspection
task for a continuum parallel surgical robot in anatomy segmented from patient
CT data. We show that IRIS computes higher-quality inspection paths orders of
magnitudes faster than a prior state-of-the-art method.Comment: RSS 201
- …