Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alan D. Christiansen

dblp:77/3520 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 1996
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 4 first-authorSystems, architecture and hardware · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Motion planning and robot control · 56% Robot manipulation · 26% Reinforcement learning · 18%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
robot design
0.011996
Automated design of part feeders using a genetic algorithm · ICRA 1996
Robotics › Motion planning and robot control
robot learning
0.031991
Learning reliable manipulation strategies without initial physical models · ICRA 1990
Experiments in Robot Learning · ML 1989
Manipulation planning for empirical backprojections · ICRA 1991
Robotics › Motion planning and robot control › motion planning
manipulation planning
0.011991
Manipulation planning for empirical backprojections · ICRA 1991
Robotics › Motion planning and robot control › robot learning › manipulation skill learning
manipulation strategy learning
0.011990
Learning reliable manipulation strategies without initial physical models · ICRA 1990
Robotics › Motion planning and robot control › robot learning
data-driven control
0.011991
Manipulation planning for empirical backprojections · ICRA 1991
Robotics › Motion planning and robot control › motion planning › manipulation planning
grasping and manipulation planning
0.011990
Learning reliable manipulation strategies without initial physical models · ICRA 1990

Methods — techniques the papers use, named apart from their topics

genetic algorithm · 0.0empirical state transition · 0.0reinforcement learning · 0.0model-based planning · 0.0exploration · 0.0robot learning · 0.0
YearPublicationVenuePosition
1996 Automated design of part feeders using a genetic algorithm
abstract
We describe a genetic algorithm approach to the automated design of vibratory bowl part feeders. Our approach gives us near-optimal designs in much less time than previously published optimal, brute-force search methods. We have implemented our approach in an automated part feeder design system, and we present preliminary results generated by our system.
Alan D. Christiansen, Andrea Dunham Edwards, Carlos A. Coello Coello
ICRA1
1995 Multiobjective design optimization of counterweight balancing of a robot arm using genetic algorithms
abstract
We present a hybrid approach to optimize the counterweight balancing of a robot arm, which uses a combination of a genetic algorithm (GA) with the min-max multiobjective optimization method to get the Pareto optimal set of solutions. This set corresponds to several possible robot designs from which the most appropriate has to be chosen by the designer. Our approach is compared to a more traditional min-max search technique in which a combination of random and sequential search was used to generate the Pareto optimal solutions. Our results show how the GA is able to get solutions with a lower deviation from the ideal vector.
Carlos A. Coello Coello, Alan D. Christiansen, Arturo Hernández Aguirre
ICTAI2
1994 Using Genetic Algorithms for Optimal Design of Trusses
abstract
The paper presents a method for optimizing the design of plane and space trusses subject to a specified set of constraints. The method is based upon a search technique using genetic algorithms. Traditional structural optimization techniques consider it continuous search space, and consequently lead to unrealistic solutions because structural members are not available in continuously varying sizes. A practical method should consider only the discrete values associated with commonly available materials. On the other hand, most modern structural optimization techniques, even when they consider a discrete search space, suffer a lack of generality, and tend to be limited to a certain kind of structure. Genetic algorithms remedy these two problems since they can deal with discrete search spaces and they are general enough to be easily extended to any kind of structure without substantial modifications. Our results show the genetic algorithm can provide very good solutions, often surpassing other complex and specialized techniques.>
Carlos A. Coello Coello, Michael Rudnick, Alan D. Christiansen
ICTAI3
1992 Learning to Predict in Uncertain Continuous Tasks
Alan D. Christiansen
ML1
1991 Manipulation planning for empirical backprojections
abstract
A method of computing manipulation plans is introduced. The empirical backprojection method uses observed state transitions to derive predictions of action effects and links these predictions to form manipulation plans. The data-intensive approach is in contrast to manipulation planning approaches that uses analysis of task mechanics to generate predictions. The empirical backprojection method is described, and three example tasks are used to illustrate the method. The assumptions underlying the method are then compared to the assumptions required by previously published analytical techniques.>
Alan D. Christiansen
ICRA1
1990 Learning reliable manipulation strategies without initial physical models
abstract
A description is given of a robot, possessing limited sensory and effectory capabilities but no initial model of the effects of its actions on the world, that acquires such a model through exploration, practice, and observation. By acquiring an increasingly correct model of its actions, it generates increasingly successful plans to achieve its goals. In an apparently nondeterministic world, achieving reliability requires the identification of reliable actions and a preference for using such actions. Furthermore, by selecting its training actions carefully, the robot can significantly improve its learning rate.>
Alan D. Christiansen, Matthew T. Mason, Tom M. Mitchell
ICRA1
1989 Experiments in Robot Learning
Matthew T. Mason, Alan D. Christiansen, Tom M. Mitchell
ML2