The implementation of a recursive algorithm for the estimation of parameters of a linear single-input single-output errors-in-variables system is re-considered. The objective is to reduce the computational complexity ...
详细信息
ISBN:
(纸本)9789896740016
The implementation of a recursive algorithm for the estimation of parameters of a linear single-input single-output errors-in-variables system is re-considered. The objective is to reduce the computational complexity in order to reduce the computation time per recursion, which, in turn, will allow a wider applicability of the recursive algorithm. The technique of stationary iterative methods for least squares is utilised, in order to reduce the complexity from cubic to quadratic order with respect to the model parameters to be estimated. A numerical simulation underpins the theoretically obtained results.
This paper provides a brief overview of the novel Meat Factory Cell and discusses its concept in the context of increasing sustainability in the meat sector. Job quality, environment, health risks, industrial developm...
详细信息
ISBN:
(纸本)9781665426848
This paper provides a brief overview of the novel Meat Factory Cell and discusses its concept in the context of increasing sustainability in the meat sector. Job quality, environment, health risks, industrial development and education are discussed as sustainability goals that can be mapped against some of the United Nations Sustainable Development Goals (SDG). Technology can arguably help to improve related processes on a societal level, and to achieve the SDGs.
This paper presents the transfer function analysis of the closed-loop system with an active disturbance rejection control (ADRC) algorithm. Although the classical interpretation of the extended state observer (ESO) an...
详细信息
ISBN:
(纸本)9798350362350;9798350362343
This paper presents the transfer function analysis of the closed-loop system with an active disturbance rejection control (ADRC) algorithm. Although the classical interpretation of the extended state observer (ESO) and control algorithm (state feedback) in the state space usually allows for achieving satisfactory control quality, the presented analysis enables calculation of the obtained pole values in the closed-loop system. Furthermore, reduction of the algorithm order by omitting the non-dominant poles of the control plant has also been proposed. The experiments were carried out on a third-order mechanical object, a ball balancing table (BBT) setup. In addition to reducing computational complexity, the presented order reduction procedure allows one to improve the properties of a closed-loop system in the case of poles with large modules affecting the control quality.
Self-assembly is a process through which an organized structure can spontaneously form from simple parts. Taking inspiration from biological examples of self-assembly, we designed and built a water-based modular robot...
详细信息
ISBN:
(纸本)9781424416462
Self-assembly is a process through which an organized structure can spontaneously form from simple parts. Taking inspiration from biological examples of self-assembly, we designed and built a water-based modular robotic system consisting of autonomous plastic tiles capable of aggregation on the surface of water. In this paper, we investigate the effect of the morphology (here: shape) of the tiles on the yield of the self-assembly process, that is, on the final amount of the desired aggregate. We describe experiments done with the real system as well as with a computer simulation thereof. We also present results of a mathematical analysis of the modular system based on chemical rate equations which point to a power-law relationship between yield rate and shape. Using the real system, we further demonstrate how through a single parameter (here: the externally applied electric potential) it is possible to control the self-assembly of propeller-like aggregates. Our results seem to provide a starting point (a) for quantifying the effect of morphology on the yield rates of self-assembly processes and (b) for assessing the level of modular autonomy and computational resources required for emergent functionality to arise.
"Space, the final frontier, to boldly go where no mail has gone before." A though trite, this statement aptly describes the necessity for space automation and robotics. Space is a relatively unfamiliar, inac...
详细信息
We present a method to estimate two-dimensional, time-invariant oceanic flow fields based on data from both ensemble forecasts and online measurements. Our method produces a realistic estimate in a computationally eff...
详细信息
ISBN:
(纸本)9781728190778
We present a method to estimate two-dimensional, time-invariant oceanic flow fields based on data from both ensemble forecasts and online measurements. Our method produces a realistic estimate in a computationally efficient manner suitable for use in marine robotics for path planning and related applications. We use kernel methods and singular value decomposition to find a compact model of the ensemble data that is represented as a linear combination of basis flow fields and that preserves the spatial correlations present in the data. Online measurements of ocean current, taken for example by marine robots, can then be incorporated using recursive Bayesian estimation. We provide computational analysis, performance comparisons with related methods, and demonstration with real-world ensemble data to show the computational efficiency and validity of our method. Possible applications in addition to path planning include active perception for model improvement through deliberate choice of measurement locations.
This paper introduces a novel task-space decomposed motion planning framework km multi-robot simultaneous locomotion and manipulation. When several manipulators hold an object, closed-chain kinematic constraints are f...
详细信息
ISBN:
(纸本)9781728190778
This paper introduces a novel task-space decomposed motion planning framework km multi-robot simultaneous locomotion and manipulation. When several manipulators hold an object, closed-chain kinematic constraints are formed, and it will make the motion planning problems challenging by inducing lower-dimensional singularities. Unfortunately, the constrained manifold will he even more complicated when the manipulators are equipped with mobile bases. We address the problem by introducing a dual-resolution motion planning framework which utilizes a convex task region decomposition method, with each resolution tuned to efficient computation for their respective roles. Concretely, this dual-resolution approach enables a global planner to explore the low-dimensional decomposed task-space regions toward the goal, then a local planner computes a path in high-dimensional constrained configuration space. We demonstrate the proposed method in several simulations, where the robot team transports the object toward the goal in the obstacle-rich environments.
Robots have been involved in our daily life more and more. This involvement comes along with a necessity for endowing robots to interact with real-world objects that are novel to them. Among many others, pushing is on...
详细信息
ISBN:
(纸本)9781665489218
Robots have been involved in our daily life more and more. This involvement comes along with a necessity for endowing robots to interact with real-world objects that are novel to them. Among many others, pushing is one of the important tasks for robotic arms (or manipulators) as it has been widely used in the pipeline of the more complicated tasks (e.g., grasping, singulation, reorienting, and similar other tasks.). In this paper, we present simple yet efficient path generation and push planning algorithms for pushing an object from a given point to a target point in the given grid map with static obstacles. Our path generation module aims to generate waypoints taking into account obstacles and quantizing them into circular regions in order to reduce the computational cost. The path is formed using the waypoints by minimizing the designed cost function. We also define a cost function for planning pushing steps aiming to both minimize the number of pushing actions and deviation from the path generated. We present comparative numerical results using simulated data. Our preliminary findings show promising results leaving room for further improvements.
Object recognition is a challenging problem for artificial systems. This is especially true for objects that are placed in cluttered and uncontrolled environments. To challenge this problem, we discuss an active appro...
详细信息
ISBN:
(纸本)9781424416462
Object recognition is a challenging problem for artificial systems. This is especially true for objects that are placed in cluttered and uncontrolled environments. To challenge this problem, we discuss an active approach to object recognition. Instead of passively observing objects, we use a robot to actively explore the objects. This enables the system to learn objects from different viewpoints and to actively select viewpoints for optimal recognition. Active vision furthermore simplifies the segmentation of the object from its background. As the basis for object recognition we use the Scale Invariant Feature Transform (SIFT). SIFT has been a successful method for image representation. However, a known drawback of SIFT is that the computational complexity of the algorithm increases with the number of keypoints. We discuss a growing-when-required (GWR) network for efficient clustering of the keypoints. The results show successful learning of 3D objects in real-world environments. The active approach is successful in separating the object from its cluttered background, and the active selection of viewpoint further increases the performance. Moreover, the GWR-network strongly reduces the number of keypoints.
To obtain the prior space information on the study problems and prevent the blind search, a novel strategy on the particle swarm optimization (PSO) is proposed. Based on the neighborhood rough set model, the prior inf...
详细信息
ISBN:
(纸本)9781424451944
To obtain the prior space information on the study problems and prevent the blind search, a novel strategy on the particle swarm optimization (PSO) is proposed. Based on the neighborhood rough set model, the prior information is achieved to guide the evolutionary state of the PSO constantly. By reserving the much relevant area of the global best point, the search space was dynamically reduced. Comparison studies with another improved PSO were performed. The experimental results for most test functions demonstrated good performance of the proposed method in both the optimization speed and computational accuracy. The results are firmly verified the effectiveness of the method to obtain the prior space information and improve the performance of the PSO.
暂无评论