MétaCan
Menu
Back to cohort
Record W2077754916 · doi:10.1177/0278364904046631

C-space Entropy: A Measure for View Planning and Exploration for General Robot-Sensor Systems in Unknown Environments

2004· article· en· W2077754916 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueThe International Journal of Robotics Research · 2004
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsMotion planningRobotKinematicsEntropy (arrow of time)Computer scienceConfiguration spaceMeasure (data warehouse)IgnoranceMathematicsMathematical optimizationArtificial intelligencePhysicsData miningClassical mechanics

Abstract

fetched live from OpenAlex

We consider the view planning problem where a range sensor is mounted on a robot mechanism with non-trivial geometry and kinematics. The robot-sensor system is required to explore the environment for obstacles and free space. We present an information theoretical approach in which the sensing action is viewed as reducing ignorance of the planning space, the C-space of the robot. The concept of C-space entropy is introduced as a measure of this ignorance. The next view in the planning process is so chosen that it maximizes the expected reduction of C-space entropy, called the maximal (expected) entropy reduction (MER) criterion. We derive closed-form expressions for expected entropy reduction for an idealized point field-of-view sensor under a Poisson point process model of the environment. We show via simulations and real experiments that the MER criterion is significantly more efficient in sensor-based path planning and exploration tasks than other purely physical space based criteria previously used in the literature.

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.

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.003
metaresearch head score (Gemma)0.001
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: Methods
Teacher disagreement score0.353
Threshold uncertainty score0.359

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
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.0010.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.143
GPT teacher head0.385
Teacher spread0.241 · 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