MétaCan
Menu
Back to cohort

Obstacle-free Trajectory Planning of an Uncertain Space Manipulator: Learning from a Fixed-Based Manipulator

2024· article· en· W4402266112 on OpenAlexafffund
T. W. Sze, Robin Chhabra

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsCarleton University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsManipulator (device)TrajectoryObstacleComputer scienceMotion planningMobile manipulatorRobot manipulatorObstacle avoidanceControl theory (sociology)RobotArtificial intelligenceMobile robotControl (management)Physics

Abstract

fetched live from OpenAlex

In a typical space debris mitigation mission, a space manipulator must plan maneuvers free of self-collision and collision with the noncooperative target satellite to perform a safe capture. We develop an effective model-free planner based on deep reinforcement learning for free-floating manipulators that only relies on an uncertain target position feedback. At its core, the learning agent employs the Deep Deterministic Policy Gradient (DDPG) algorithm capable of working with continuous states and actions. To improve the learning performance, we propose a five-step sequential learning that uses priority episode sampling to effectively transfer knowledge from a fixed-based manipulator trained to follow a moving target to an uncertain space manipulator capturing a target point on a satellite. Further, to avoid moving obstacles, we introduce the notion of multi-critic in the DDPG setting, such that one critic optimizes the task of chasing in an uncertain environment and another one focuses on obstacle avoidance. To show the efficacy of the developed trajectory planner, we compare its running average success rate and reward value with a baseline DDPG.

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 categoriesMeta-epidemiology (narrow)
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.494
Threshold uncertainty score1.000

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.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.044
GPT teacher head0.280
Teacher spread0.236 · 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.

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
Published2024
Admission routes2
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207