To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
For typical optimization problems, the design space of interest is well defined: It is a subset of Rn, where n is the number of (continuous) variables. Constraints are often introduced to eliminate infeasible regions of this space from consideration. Many engineering design problems can be formulated as search in such a design space. For configuration design problems, however, the design space is much more difficult to define precisely, particularly when constraints are present. Configuration design spaces are discrete and combinatorial in nature, but not necessarily purely combinatorial, as certain combinations represent infeasible designs. One of our primary design objectives is to drastically reduce the effort to explore large combinatorial design spaces. We believe it is imperative to develop methods for mathematically defining design spaces for configuration design. The purpose of this paper is to outline our approach to defining configuration design spaces for engineering design, with an emphasis on the mathematics of the spaces and their combinations into larger spaces that more completely capture design requirements. Specifically, we introduce design spaces that model physical connectivity, functionality, and assemblability considerations for a representative product family, a class of coffeemakers. Then, we show how these spaces can be combined into a “common” product variety design space. We demonstrate how constraints can be defined and applied to these spaces so that feasible design regions can be directly modeled. Additionally, we explore the topological and combinatorial properties of these spaces. The application of this design space modeling methodology is illustrated using the coffeemaker product family.
This paper presents a novel knowledge-based Petri net approach to mechanical systems and assemblies modeling within a design with objects environment. A new unified class of object-oriented knowledge Petri nets, which can incorporate a knowledge-based system with ordinary Petri nets, is defined and used for the unified representations of assembly design and modeling. The object knowledge Petri nets, as a graphical language and a new knowledge-based description scheme, can be used to express the qualitative and quantitative aspects of the assembly design and modeling process in an interactive and integrated way. The four-level hierarchy model is proposed and constructed in terms of function-behaviors, structures, geometries, and features. The function-behavior-structure description is built on more abstract concepts so that it can match well top-down design. The static and dynamic characteristics in the design of assembly can also be captured. With the help of fuzzy logic, the incomplete, imprecise knowledge and uncertainty in the design process can also be dealt with. Therefore, the hybrid design object model can incorporate product data model, top-down design process, and assembly process model using an object-oriented, knowledge-based, feature-based, parametric, and constraint-based modeling approach, and can provide a more accurate and more flexible representation. To verify and demonstrate the effective use of the proposed hybrid design object model, a prototype system has been developed. This research provides a knowledge-intensive framework for intelligent assembly design and modeling.
The current paper describes the Multidisciplinary Combinatorial Approach (MCA), the idea of which is to develop discrete mathematical representations, called “Combinatorial Representations” (CR) and to represent with them various engineering systems. During the research, the properties and methods embedded in each representation and the connections between them were investigated thoroughly, after which they were associated with various engineering systems to solve related engineering problems. The CR developed up until now are based on graph theory, matroid theory, and discrete linear programming, whereas the current paper employs only the first two. The approach opens up new ways of working with representations, reasoning and design, some of which are reported in the paper, as follows: 1) Integrated multidisciplinary representation—systems which contain interrelating elements from different disciplines are represented by the same CR. Consequently, a uniform analysis process is performed on the representation, and thus on the whole system, irrespective of the specific disciplines, to which the elements belong. 2) Deriving known methods and theorems—new proofs to known methods and theorems are derived in a new way, this time on the basis of the combinatorial theorems embedded in the CR. This enables development of a meta-representation for engineering as a whole, through which the engineering reasoning becomes convenient. In the current paper, this issue is illustrated on structural analysis. 3) Deriving novel connections between remote fields—new connections are derived on the basis of the relations between the different combinatorial representations. An innovative connection between mechanisms and trusses, shown in the paper, has been derived on the basis of the mutual dualism between their corresponding CR. This new connection alone has opened several new avenues of research, since knowledge and algorithms from machine theory are now available for use in structural analysis and vice versa. Furthermore, it has opened opportunities for developing new design methods, in which, for instance, structures with special properties are developed on the basis of known mechanisms with special properties, as demonstrated in this paper. Conversely, one can use these techniques to develop special mechanisms from known trusses.
This paper presents a framework and a prototype for designing Integrated Construction Management (ICM) software applications using reusable components. The framework supports the collaborative development of ICM software applications by a group of ICM application developers from a library of software components. The framework focuses on the use of an explicit software development process to capture and disseminate specialized knowledge that augments the description of the ICM software application components in a library. The importance of preserving and using this knowledge has become apparent with the recent trend of combining the software development process with the software application code. There are three main components in the framework: design patterns, design rationale model, and intelligent search algorithms. Design patterns have been chosen to represent, record, and reuse the recurring design structures and associated design experience in object-oriented software development. The Design Recommendation and Intent Model (DRIM) was extended in the current research effort to capture the specific implementation of reusable software components. DRIM provides a method by which design rationale from multiple ICM application designers can be partially generated, stored, and later retrieved by a computer system. To address the issues of retrieval, the paper presents a unique representation of a software component, and a search mechanism based on Reggia's setcover algorithm to retrieve a set of components that can be combined to get the required functionality is presented. This paper also details an initial, proof-of-concept prototype based on the framework. By supporting nonobtrusive capture as well as effective access of vital design rationale information regarding the ICM application development process, the framework described in this paper is expected to provide a strong information base for designing ICM software.
We present a new representation that allows a rigid-body dynamic simulation to be described as a set of “causal-processes.” A causal-process is an interval of time during which both the behavior and the causes of the behavior remain qualitatively uniform. The representation consists of acyclic, directed graphs that are isomorphic to the flow of causality through the kinematic chain. Forces are the carriers of causality in this domain; thus they are central to the representation. We use this representation to compute the purposes of the geometric features on the parts of a device. To compute the purpose of a particular feature, we simulate the behavior of the device with and without the feature present. We then re-represent the two simulations as causal-processes and identify any causal-processes that exist in one simulation but not the other. Such processes are indicative of the feature's purpose. Because they are already causal descriptions of behavior, they can be directly translated into natural language descriptions of the feature's purpose. We have implemented our approach in a computer program called ExplainIT II.
A fast and accurate method for detecting the collisions of convex polyhedra in a graphical simulation environment based on a newly developed method of distance estimate is presented. By the simultaneous use of the enclosing and the enclosed ellipsoids of convex polyhedra, potential collisions can be detected more accurate than those methods using only bounding volume for object representation, and more efficient than the polyhedral methods. An approach for computing the enclosed ellipsoid of a convex polyhedron by compressing, stretching and scaling operations on its best-fit enclosing ellipsoid is introduced. Graphical simulations of two case studies (moving polyhedral objects in three-dimensional space and multiple robot arms undergoing straight line motions) are conducted to demonstrate the accuracy of the proposed algorithm for collision detection.
The theory presented here is a new, radical step in the research program that started with linear logic and aiming at an interactive, resource and space conscious account of reasoning and programming.
This paper describes detailed velocity kinematics and the statics of serial and parallel robots. Without resorting to the screw theory, the duality between these two types of robots is demonstrated. This duality concerns operational speeds of serial robots and operational forces of parallel robots, as well as internal speeds in redundant serial robots and internal forces in redundant parallel robots. This approach allows a deeper understanding of the duality between these two types of robots, particularly when they are redundant.
Whilst research continues to produce robots that mimic nature's creatures, scientists at the Northwestern University in Chicago, USA have developed a robot that is controlled by the brain of a sea lamprey. This is therefore an example of a biological robot, perhaps the first of many that will be developed.
This paper presents a real-time algorithm for modifying the trajectory of a manipulator approaching a moving target. The algorithm is based on the superposition scheme; a model developed based on human motion behavior. The algorithm generates a smooth trajectory toward the new target by calculating the vectorial sum between the first trajectory (initial position and first target) and second trajectory (between first and second target location). The algorithm searches for the switch hme that will result in a minimum time trajectory. The idea of the algorithm is to define some domain where the optimal switching time can be found, reduce this domain as much as possible to decrease the number of the points that must be checked and try every remaining candidate in this domain to find numerically the best (optimal) switch time. The algorithm was implemented on an Adept-one robotic system taking into account velocity constraints. The actual velocity profile was found to be less smooth than specified by the mathematical model. When the switch occurs at the middle of the trajectory when the speed is close to its maximum, the change in the movement direction is performed more gently.
A work cell with multiple robots increases manufacturing flexibility and productivity. Robots in the work cell equipped in a sparse area usually share a motion path, resources and workspace. In this paper, an embedded Markov chain model for a multi-robot system that has a common workspace is constructed on the basis of the concept of a multi-processor system. With the presented model, we measure the performance of error recovery schemes under different workloads and analyze the sensitivity of the execution time with respect to the robot speed. We verify the presented model with an experimental multi-robot work cell. This study is useful in evaluating the performance of a robotic work cell and presents a guide for designing a complex work cell.
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) The headquarters of the People Programmer was at An-Fang, and there the mistake happened: A ruby trembled. Two tourmaline nets failed to rectify the laser beam. A diamond noted the error. Both the error and the correction went into the general computer. Cordwainer SmithThe Dead Lady of Clown Town, 1964.
The above event will be held on March 24–26, 2002, in Pittsburgh, Pennsylvania (USA) in the context of the joint meeting of the World Organisation of Systems and Cybernetics (WOSC) and of the International Institute for General Systems Studies (IIGSS) (12th WOSC Congress and 4th IIGSS Workshop).
This paper describes an on-going project to develop robotic systems for locating chemical sources in constrained environments. There is increasing interest in applying chemical sensing to mobile robots. Locating the source of a chemical plume is seen as an important use for a chemical sensing robot. Current research tends to concentrate on source location in open and relatively obstacle free environments. Many of the applications for this technology will be areas where airflow is constrained and deflected by obstacles such as inside buildings, mines and subway tunnels. It is this kind of situation that this project aims to address.
We present a feature-based probabilistic map building algorithm which directly utilizes time and amplitude information of sonar in indoor environments. Utilizing additional amplitude-of-signal (AOS) obtained concurrently with time-of-flight (TOF), the amount of inclination of target can be directly calculated from a single echo, and the number of measurements can be greatly reduced with result similar to dense scanning. A set of target groups (set of hypothesized targets originated from one measurement) is used and refined by each measurement using an extended Kalman filter and Bayesian conditional probability. Experimental results in a real indoor environment are presented to show the validity of our algorithm.