Quadrotor or popularly known as quadcopter is an unmanned flying robotic platform that is driven by four fixed rotors. Quadrotors serve as a perfect flying platform in an anonymous and intricate environments eliminati...
详细信息
ISBN:
(纸本)9781509047154
Quadrotor or popularly known as quadcopter is an unmanned flying robotic platform that is driven by four fixed rotors. Quadrotors serve as a perfect flying platform in an anonymous and intricate environments eliminating the need to jeopardize human life in such hazardous situations. Apart from serving as a stable flight stage, these can do breathtaking acrobatic and complex maneuvers that are beyond the scope of the conventional aerial vehicles. There has been a tremendous surge in funding for research and development of such Unmanned Aerial Vehicles (UAV) as the investors are very well aware of the influence these robots have in military as well as civilian market. However the flip side to these overwhelming abilities the quadrotors have is the need for a robust and an efficient control model. The system designing process is a complex integration of aero-modeling and apt control techniques for stability. Multiple parameters need to be co-ordinated in real time for a smooth control of a multi rotor vehicle. This generally results in complex algorithms which increase computation requirements that can be costly. On the other hand cost reduction implies limitations in performance or poor control. This paper focuses to solve these challenges by dramatically simplifying the complexity of control algorithms without compromising on performance parameters of the quadrotor following strict cost constraints. We streamline the mathematical model simulations and the use of PD and PID control techniques by constraint based optimization that results in a simple, cost-effective and a robust control model. Through rigorous simulations and testing we not only obtain a faithful control model but also execute a self-leveling feature making the quadrotor smart. We also discuss the future possibilities for low-cost autonomous navigation in indoor environments.
How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing. Picture a computer scientist, staring at a screen and clicking away frant...
详细信息
ISBN:
(纸本)9780262036634
How Hansel and Gretel, Sherlock Holmes, the movie Groundhog Day, Harry Potter, and other familiar stories illustrate the concepts of computing. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.
Hematopoietic stem cell transplantation (HSCT) is a medical procedure in the field of hematology and oncology, most often performed for patients with certain cancers of the blood or bone marrow. A lot of patients have...
详细信息
Hematopoietic stem cell transplantation (HSCT) is a medical procedure in the field of hematology and oncology, most often performed for patients with certain cancers of the blood or bone marrow. A lot of patients have no suitable HLA-matched donor within their family, so physicians must activate a "donor search process" by interacting with national and international donor registries who will search their databases for adult unrelated donors or cord blood units (CBU). Information and communication technologies play a key role in the donor search process in donor registries both nationally and internationaly. One of the major challenges for donor registry computer systems is the development of a reliable search algorithm. This work discusses the top-down design of such algorithms and current practice. Based on our experience with systems used by several stem cell donor registries, we highlight typical pitfalls in the implementation of an algorithm and underlying data structure.
A self-calibration technique for mobile three-dimensional vision is presented. This technique determines the vision parameters during the vision task based on computer algorithms and image processing. The three-dimens...
详细信息
A self-calibration technique for mobile three-dimensional vision is presented. This technique determines the vision parameters during the vision task based on computer algorithms and image processing. The three-dimensional vision is performed by a Bezier network based on laser line projection. This network provides the data to perform the online self-calibration when the vision system is modified. Here, the changes of the extrinsic and intrinsic parameters are determined. The structure of the network is performed by the line shifting provided by the surface depth. From this structure, the data for the initial calibration and online self-calibration are deduced. In this manner, the calibrated references and physical measurements are avoided to perform the online self-calibration. Therefore, calibration limitations caused by online modifications are overcome to perform the mobile vision. Thus, the proposed self-calibration improves the accuracy and performance of the mobile vision. It is because online data of calibrated references are not passed to the vision system. This procedure represents a contribution in the field of the online recalibration, which is performed based on calibrated references. To elucidate this contribution, an evaluation is performed based on the self-calibration methods, which are reported in the recent years. Also, the time processing is described. (C) 2010 Elsevier Ltd. All rights reserved.
The problem which grate cooler is nonlinear and large lag, the traditional control method is difficult to achieve precise control effect. The dynamic matrix control has prominent advantages in solving
ISBN:
(纸本)9781467389808
The problem which grate cooler is nonlinear and large lag, the traditional control method is difficult to achieve precise control effect. The dynamic matrix control has prominent advantages in solving
The Divergence of Stone's Factorizations when No Parameters Are Used by Diamond, Martin; University of Illinois at Urbana-Champaign. Dept. of computer Science; published by Urbana, Ill. : Dept. of computer Science...
详细信息
The Divergence of Stone's Factorizations when No Parameters Are Used by Diamond, Martin; University of Illinois at Urbana-Champaign. Dept. of computer Science; published by Urbana, Ill. : Dept. of computer Science, University of Illinois at Urbana-Champaign
Background and study aims: Early neoplasia in Barrett's esophagus is difficult to detect and often overlooked during Barrett's surveillance. An automatic detection system could be beneficial, by assisting endo...
详细信息
Background and study aims: Early neoplasia in Barrett's esophagus is difficult to detect and often overlooked during Barrett's surveillance. An automatic detection system could be beneficial, by assisting endoscopists with detection of early neoplastic lesions. The aim of this study was to assess the feasibility of a computer system to detect early neoplasia in Barrett's esophagus. Patients and methods: Based on 100 images from 44 patients with Barrett's esophagus, a computer algorithm, which employed specific texture, color filters, and machine learning, was developed for the detection of early neoplastic lesions in Barrett's esophagus. The evaluation by one endoscopist, who extensively imaged and endoscopically removed all early neoplastic lesions and was not blinded to the histological outcome, was considered the gold standard. For external validation, four international experts in Barrett's neoplasia, who were blinded to the pathology results, reviewed all images. Results: The system identified early neoplastic lesions on a per-image analysis with a sensitivity and specificity of 0.83. At the patient level, the system achieved a sensitivity and specificity of 0.86 and 0.87, respectively. A trade-off between the two performance metrics could be made by varying the percentage of training samples that showed neoplastic tissue. Conclusion: The automated computer algorithm developed in this study was able to identify early neoplastic lesions with reasonable accuracy, suggesting that automated detection of early neoplasia in Barrett's esophagus is feasible. Further research is required to improve the accuracy of the system and prepare it for real-time operation, before it can be applied in clinical practice.
To deal with the problems of illumination changes or pose variations and serious partial occlusion, patch based multiple instance learning (P-MIL) algorithm is proposed. The algorithm divides an object into many block...
详细信息
To deal with the problems of illumination changes or pose variations and serious partial occlusion, patch based multiple instance learning (P-MIL) algorithm is proposed. The algorithm divides an object into many blocks. Then, the online MIL algorithm is applied on each block for obtaining strong classifier. The algorithm takes account of both the average classification score and classification scores of all the blocks for detecting the object. In particular, compared with the whole object based MIL algorithm, the P-MIL algorithm detects the object according to the unoccluded patches when partial occlusion occurs. After detecting the object, the learning rates for updating weak classifiers' parameters are adaptively tuned. The classifier updating strategy avoids overupdating and underupdating the parameters. Finally, the proposed method is compared with other state-of-the-art algorithms on several classical videos. The experiment results illustrate that the proposed method performs well especially in case of illumination changes or pose variations and partial occlusion. Moreover, the algorithm realizes real-time object tracking.
The computation of the augmented electric field integral equation (A-EFIE) is accelerated by using the multilevel complex source beam (MLCSB) method. As an effective solution of the low-frequency problem, A-EFIE inclu...
详细信息
The computation of the augmented electric field integral equation (A-EFIE) is accelerated by using the multilevel complex source beam (MLCSB) method. As an effective solution of the low-frequency problem, A-EFIE includes both current and charge as unknowns to avoid the imbalance between the vector potentials and the scalar potentials in the conventional EFIE. However, dense impedance submatrices are involved in the A-EFIE system, and the computational cost becomes extremely high for problems with a large number of unknowns. As an exact solution to Maxwell's equations, the complex source beam (CSB) method can be well tailored for A-EFIE to accelerate the matrix-vector products in an iterative solver. Different from the commonly used multilevel fast multipole algorithm (MLFMA), the CSB method is free from the problem of low-frequency breakdown. In our implementation, the expansion operators of CSB are first derived for the vector potentials and the scalar potentials. Consequently, the aggregation and disaggregation operators are introduced to form a multilevel algorithm to reduce the computational complexity. The accuracy and efficiency of the proposed method are discussed in detail through a variety of numerical examples. It is observed that the numerical error of the MLCSB-AEFIE keeps constant for a broad frequency range, indicating the good stability and scalability of the proposed method.
This paper proposes an artificial immune network based on cloud model (AINet-CM) for complex function optimization problems. Three key immune operators-cloning, mutation, and suppression-are redesigned with the help o...
详细信息
This paper proposes an artificial immune network based on cloud model (AINet-CM) for complex function optimization problems. Three key immune operators-cloning, mutation, and suppression-are redesigned with the help of the cloud model. To be specific, an increasing half cloud-based cloning operator is used to adjust the dynamic clone multipliers of antibodies, an asymmetrical cloud-based mutation operator is used to control the adaptive evolution of antibodies, and a normal similarity cloud-based suppressor is used to keep the diversity of the antibody population. To quicken the searching convergence, a dynamic searching step length strategy is adopted. For comparative study, a series of numerical simulations are arranged between AINet-CM and the other three artificial immune systems, that is, opt-aiNet, IA-AIS, and AAIS-2S. Furthermore, two industrial applications-finite impulse response (FIR) filter design and proportional-integral-differential (PID) controller tuning-are investigated and the results demonstrate the potential searching capability and practical value of the proposed AINet-CM algorithm.
暂无评论