MétaCan
Menu
Back to cohort
Record W2143847692 · doi:10.1109/isic.1994.367817

Algorithmic approach to action planning for assembly automation using state matrix representation

2002· article· en· W2143847692 on OpenAlexaff
S. M. Noorhosseini, A.S. Malowany

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicManufacturing Process and Optimization
Canadian institutionsMcGill University
Fundersnot available
KeywordsWorkcellPlannerRepresentation (politics)Computer scienceDomain (mathematical analysis)AutomationArtificial intelligenceKnowledge representation and reasoningMatrix representationAutomated planning and schedulingAction (physics)Motion planningState (computer science)Theoretical computer scienceRobotAlgorithmEngineeringMathematics

Abstract

fetched live from OpenAlex

Action planning ability is essential for autonomous behavior of an intelligent control system. This paper presents a new generic algorithm for action planning in a robotic workcell which provides a mechanism for incorporation of domain knowledge. The planning system is based on a new representation scheme called state matrix representation which uses the inter-relationships of objects to model the world. The robot assembly domain is chosen to demonstrate the merits of our planner and the new representational scheme. However the planning methodology and the state and action representation schemes are not limited to the assembly automation domain. An example of automatic plan generation for an assembly operation based on this representation and planning methodology is given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.645
Threshold uncertainty score0.406

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.068
GPT teacher head0.311
Teacher spread0.242 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicManufacturing Process and OptimizationFrench-language works237,207