<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Bayesian optimisation &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/bayesian-optimisation/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Thu, 08 Oct 2026 21:56:02 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>Bayesian optimisation &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>Machine Learning Shortcut Screens Thousands of Kuiper Belt Targets in Seconds</title>
		<link>https://scienmag.com/machine-learning-shortcut-screens-thousands-of-kuiper-belt-targets-in-seconds/</link>
		
		<dc:creator><![CDATA[Teresa Odom]]></dc:creator>
		<pubDate>Thu, 08 Oct 2026 21:56:02 +0000</pubDate>
				<category><![CDATA[Space]]></category>
		<category><![CDATA[adaptive sampling]]></category>
		<category><![CDATA[AI applications in space mission analysis]]></category>
		<category><![CDATA[astrodynamics]]></category>
		<category><![CDATA[Bayesian optimisation]]></category>
		<category><![CDATA[computational methods in space exploration]]></category>
		<category><![CDATA[deep-space manoeuvres]]></category>
		<category><![CDATA[deep-space navigation challenges]]></category>
		<category><![CDATA[Gaussian process regression]]></category>
		<category><![CDATA[gravity assists]]></category>
		<category><![CDATA[high-fidelity simulations in astrophysics]]></category>
		<category><![CDATA[interplanetary mission design]]></category>
		<category><![CDATA[interplanetary transfers]]></category>
		<category><![CDATA[Kuiper Belt exploration]]></category>
		<category><![CDATA[Kuiper Belt objects]]></category>
		<category><![CDATA[Machine learning]]></category>
		<category><![CDATA[machine learning in space science]]></category>
		<category><![CDATA[mission design]]></category>
		<category><![CDATA[planetary science target screening]]></category>
		<category><![CDATA[space mission planning automation]]></category>
		<category><![CDATA[surrogate modeling for space missions]]></category>
		<category><![CDATA[surrogate modelling]]></category>
		<category><![CDATA[trajectory design]]></category>
		<category><![CDATA[trajectory optimization]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=249893</guid>

					<description><![CDATA[Researchers have trained a Gaussian process surrogate model that screens thousands of Kuiper Belt Objects for mission accessibility in seconds, predicting transfer costs to within about 0.13 kilometres per second for the most reachable targets.]]></description>
										<content:encoded><![CDATA[<p>Reaching the Kuiper Belt is one of the hardest problems in interplanetary mission design. These frozen worlds orbit billions of kilometres from the Sun, and a spacecraft sent to visit one must thread a path past Jupiter, fire deep-space manoeuvres along the way, and arrive with a relative speed low enough to be scientifically useful. Finding out whether a particular Kuiper Belt Object is realistically reachable has traditionally required running a full trajectory optimisation for every candidate target, a computationally brutal process when the candidate list runs into the thousands. A new study published in Astrophysics and Space Science by Linzhi Meng, Xingyu Zhou, Dong Qiao and Xiangyu Li, researchers at the Beijing Institute of Technology with affiliations at the China Academy of Space Technology and Macau University of Science and Technology, offers a way out: a machine-learning surrogate model that can screen thousands of potential destinations in a fraction of the time a single high-fidelity optimisation would take.</p>
<p>The core idea is deceptively simple. Instead of solving the full multiple-gravity-assist trajectory optimisation problem for every Kuiper Belt Object, the team trained a Gaussian process regression model to predict how expensive a transfer would be, based only on the orbital characteristics of the target. The training labels for this model came from genuine high-fidelity optimisations: for a set of representative targets, the researchers ran a complete optimisation of an Earth–Jupiter–Kuiper Belt Object transfer, including the deep-space manoeuvres that allow a spacecraft to adjust its course between gravity assists. Each optimisation produced two numbers that matter enormously to mission planners: the total deep-space manoeuvre velocity increment, essentially the fuel cost of the transfer, and the time of flight. Those pairs of numbers became the ground truth from which the surrogate learned.</p>
<p>A crucial design decision was how to represent each target to the machine-learning algorithm. The team compared seven different ways of encoding a Kuiper Belt Object&#8217;s orbit, ranging from classical orbital elements such as semimajor axis, eccentricity and inclination, to Cartesian, cylindrical and spherical position-and-velocity states sampled at fixed epochs. This choice matters because a Gaussian process model builds its predictions from similarities between inputs, and a representation that hides the physically relevant structure of the problem will degrade the predictions even if the underlying data are identical. After systematic comparison, a multi-epoch Cartesian representation, in which the target&#8217;s heliocentric state is recorded at several fixed times, gave the most balanced performance across both prediction of transfer cost and ranking of targets by accessibility.</p>
<p>Two further refinements sharpened the model&#8217;s usefulness. First, the researchers applied a logarithmic scaling to the transfer objective, which concentrated the model&#8217;s accuracy in the low-cost region of the distribution, precisely where mission designers care most, because targets with transfer costs below roughly one kilometre per second of deep-space manoeuvring are the ones worth pursuing. Second, they employed uncertainty-guided adaptive sampling, a technique rooted in Bayesian optimisation in which the model itself identifies the regions of input space where its predictions are least confident, and new expensive optimisations are run there to improve the training set. This active-learning strategy measurably improved both the precision and the recall of the screening process at the tested screening fractions of 10 and 20 percent, meaning the model both missed fewer genuinely accessible targets and wasted less attention on inaccessible ones.</p>
<p>The quantitative results are striking. On an independent test set of targets the model had never seen, the Gaussian process regression achieved a global mean absolute error of 0.673 kilometres per second on the transfer objective and 537.5 days on the time of flight. Those global figures, however, mask a far more encouraging picture in the region that matters. For cases whose validated transfer objective was below one kilometre per second, the mean absolute error dropped to just 0.133 kilometres per second, and for cases the surrogate itself selected as having predicted costs below that threshold, the error was 0.245 kilometres per second. The larger global mean reflects the sparse high-cost tail of the objective distribution, where a handful of extremely expensive transfers dominate the average error but are of little practical interest for mission selection.</p>
<p>The demonstration that ties the method together was applied to a catalogue of 2,223 representative Kuiper Belt Object targets. Running the surrogate across this population, the team identified the ten targets with the lowest predicted transfer objectives, candidates that would then be passed on for full multiple-gravity-assist and deep-space-manoeuvre validation. This two-stage workflow, cheap surrogate screening followed by expensive high-fidelity confirmation, is the same philosophy that has transformed other branches of engineering design, and the study shows it can be brought to bear on one of the most computationally demanding problems in astrodynamics. The researchers note that the approach is demonstrated for the prescribed Earth–Jupiter–Kuiper Belt Object transfer scenario, with the gravity-assist sequence fixed in advance.</p>
<p>The technical machinery underneath the method draws on a rich literature. Lambert&#8217;s problem, the classical boundary-value problem of orbital mechanics that connects two positions in space with a transfer orbit, underpins the generation of candidate trajectory legs, and modern robust solvers have made such computations fast and reliable. The global optimisation of the full trajectory, with its mixture of continuous variables such as departure epochs, manoeuvre magnitudes and flyby geometry, relies on evolutionary algorithms such as differential evolution, which have proven robust for the multimodal landscapes that trajectory optimisation produces. Gaussian process regression, meanwhile, brings a distinctive advantage over other machine-learning approaches: it provides not just a point prediction but an associated uncertainty estimate for every input, which is exactly what makes uncertainty-guided adaptive sampling possible and what allows a mission designer to know how much to trust a given screening result.</p>
<p>Why does this matter beyond the mathematics? The Kuiper Belt is one of the last great unexplored reservoirs of the solar system, a ring of icy bodies beyond Neptune that preserves a record of the primordial material from which the planets formed. NASA&#8217;s New Horizons mission gave humanity its first close look at a Kuiper Belt Object when it flew past Arrokoth in 2019, and concepts for an interstellar probe and follow-on Kuiper Belt missions continue to circulate in the planetary science community. But the sheer number of known and expected objects in this region means that target selection is itself a formidable optimisation problem. Every candidate target implies a different launch window, a different gravity-assist choreography and a different fuel budget, and choosing poorly can cost a mission a decade of flight time or render it infeasible altogether. Rapid, reliable accessibility assessment is therefore not a luxury but a prerequisite for ambitious outer-solar-system exploration.</p>
<p>The study also fits into a broader trend in which machine learning serves as an accelerant for, rather than a replacement of, classical astrodynamics. Earlier work demonstrated that Gaussian process regression could assess the accessibility of main-belt asteroids, and neural networks have been applied to orbit uncertainty propagation and estimation. The present research extends that paradigm to the most distant and most expensive class of targets, and its careful comparison of state representations and sampling strategies offers a practical template for other teams. The authors acknowledge support from the National Natural Science Foundation of China, and the datasets generated during the study are available from the corresponding author on reasonable request.</p>
<p>There remain, of course, limits to what any surrogate can do. The model was trained and validated for a specific transfer scenario with a prescribed gravity-assist sequence, and its accuracy in the low-cost region, while excellent, comes at the price of larger errors in the sparse high-cost tail. The ten targets flagged by the surrogate still require full optimisation before any mission commitment, and the screening fractions of 10 and 20 percent represent a trade-off between computational savings and the risk of overlooking a hidden gem. Yet the headline numbers speak for themselves: a model that predicts transfer costs to within a few hundred metres per second for the targets that matter, ranks thousands of destinations in seconds, and hands mission designers a principled, uncertainty-aware shortlist. As the catalogue of Kuiper Belt Objects continues to grow, tools like this one may well decide which frozen worlds humanity visits next.</p>
<p><strong>Subject of Research:</strong> Surrogate-based machine learning for rapid assessment of spacecraft transfer accessibility to Kuiper Belt Objects</p>
<p><strong>Article Title:</strong> Surrogate-based rapid accessibility assessment of Kuiper Belt object transfers</p>
<p><strong>Article References:</strong> Meng, L., Zhou, X., Qiao, D., &amp; Li, X. (2026). Surrogate-based rapid accessibility assessment of Kuiper Belt object transfers. <em>Astrophysics and Space Science, 371</em>(10), Article 116. <a href="https://doi.org/10.1007/s10509-026-04650-9" rel="noopener noreferrer">https://doi.org/10.1007/s10509-026-04650-9</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s10509-026-04650-9" rel="noopener noreferrer">10.1007/s10509-026-04650-9</a></p>
<p><strong>Keywords:</strong> Kuiper Belt objects, trajectory design, Gaussian process regression, surrogate modelling, gravity assists, deep-space manoeuvres, adaptive sampling, astrodynamics, mission design, machine learning, interplanetary transfers, Bayesian optimisation</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">249893</post-id>	</item>
		<item>
		<title>AI Learns to Find a Robot&#8217;s Most Dangerous Pose Before It Ever Moves</title>
		<link>https://scienmag.com/ai-learns-to-find-a-robots-most-dangerous-pose-before-it-ever-moves/</link>
		
		<dc:creator><![CDATA[Denise Maddox]]></dc:creator>
		<pubDate>Sat, 12 Sep 2026 19:08:17 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[advanced robotics design using AI]]></category>
		<category><![CDATA[autonomous identification of dangerous robot postures]]></category>
		<category><![CDATA[Bayesian optimisation]]></category>
		<category><![CDATA[Bayesian optimization in robotics]]></category>
		<category><![CDATA[cable-driven manipulator]]></category>
		<category><![CDATA[cable-driven manipulator safety assessment]]></category>
		<category><![CDATA[computational methods for robot stress analysis]]></category>
		<category><![CDATA[configuration space]]></category>
		<category><![CDATA[Expected Improvement]]></category>
		<category><![CDATA[finite element analysis]]></category>
		<category><![CDATA[finite element simulation reduction]]></category>
		<category><![CDATA[Gaussian process]]></category>
		<category><![CDATA[high degree-of-freedom robot pose evaluation]]></category>
		<category><![CDATA[hyper-redundant robots]]></category>
		<category><![CDATA[machine learning for robotic safety]]></category>
		<category><![CDATA[robot pose optimization]]></category>
		<category><![CDATA[robotics]]></category>
		<category><![CDATA[safe operation of flexible robotic arms]]></category>
		<category><![CDATA[stress analysis in hyper-redundant robots]]></category>
		<category><![CDATA[structural design]]></category>
		<category><![CDATA[structural stress prediction in robotic configurations]]></category>
		<category><![CDATA[surrogate modelling]]></category>
		<category><![CDATA[Von Mises stress]]></category>
		<category><![CDATA[worst-case stress]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=197724</guid>

					<description><![CDATA[Researchers at the Italian Institute of Technology used Bayesian optimisation with a Gaussian process surrogate to identify stress-critical poses of a cable-driven hyper-redundant robot with only 250 finite element simulations.]]></description>
										<content:encoded><![CDATA[<p>Every robot pose is not created equal. For a slender, snake-like manipulator with five joints and a bundle of cables threading through its body, a subtle change in posture can quietly shift where internal forces concentrate, turning an innocuous-looking configuration into the single most structurally punishing position the machine can adopt. Finding that worst-case pose has long been a computational nightmare, because verifying the stress inside even one configuration requires a full finite element simulation. A team of roboticists at the Italian Institute of Technology and the University of Genova has now shown that a machine-learning technique called Bayesian optimisation can hunt down these stress-critical poses with a small fraction of the simulations that brute-force methods would demand, offering a new route to safer robot design and operation.</p>
<p>The research, published in the International Journal of Intelligent Robotics and Applications, focuses on a cable-driven hyper-redundant robot, a class of machines defined by a very high number of degrees of freedom. Hyper-redundant manipulators are prized for their manoeuvrability in confined and challenging environments, from inspection ducts to maintenance scenarios where conventional rigid arms cannot reach. But that flexibility comes at a price. Because each joint can move independently, the space of feasible postures is vast, and each posture produces a different distribution of internal loads. The mapping from configuration to peak stress is highly nonlinear and can only be evaluated reliably through computationally expensive simulations, making an exhaustive search impractical even for a five-dimensional problem.</p>
<p>The core of the new workflow treats worst-case stress identification as a black-box maximisation problem over the robot&#8217;s configuration space. For any candidate pose, a recursive statics model first computes the forces and moments that the rest of the manipulator transmits to the component of interest, in this case the robot&#8217;s first link. Cable tensions, gravity and the geometry of the cable routing all enter this equilibrium calculation, which is solved sequentially from the distal end of the arm toward the base. The resulting interface reactions then serve as boundary conditions for a finite element analysis of the link, performed in ANSYS, which returns the peak Von Mises stress, the standard scalar measure engineers use to gauge how close a material is to failure.</p>
<p>Running that pipeline for every conceivable pose would be prohibitively slow, so the researchers built a surrogate model that learns the relationship between configuration and stress. The surrogate is a Gaussian process, a probabilistic model that not only predicts the stress at any pose but also quantifies how confident it is in that prediction. The team used an ARD Matérn 5/2 kernel, a mathematical structure whose per-dimension length scales reveal which joint variables matter most to the stress response, and trained it on an initial set of 200 poses generated by Latin hypercube sampling across the joint limits of minus 45 to plus 45 degrees. All inputs and outputs were z-score standardised before training to keep the numerics well conditioned.</p>
<p>Bayesian optimisation then took over. The algorithm repeatedly asks where the next finite element simulation should be spent, using an acquisition function called Expected Improvement that balances two competing urges: exploiting regions where the model already predicts high stress, and exploring regions where its uncertainty is large, since a hidden danger may lurk there. Rather than evaluating one pose at a time, the framework uses batch Expected Improvement, proposing ten configurations per iteration that are evaluated in parallel. Because the batch criterion accounts for correlations between the proposed points, it penalises redundant, near-identical samples and rewards diverse batches that jointly cover both promising and uncertain regions of the configuration space.</p>
<p>The optimisation converged after just six Bayesian iterations, corresponding to 250 evaluated configurations in total. The identified worst-case pose produced a peak stress of 14.23 megapascals, an improvement of 1.41 percent over the best configuration found in the initial random design. That modest gain is itself informative: the space-filling initial design had already sampled near the critical region, and the Bayesian loop refined and confirmed the most demanding neighbourhood rather than drifting elsewhere. The Expected Improvement values attached to proposed batches fell from 16.2 percent of the normalised output range at the first iteration to 0.21 percent at convergence, indicating genuine saturation rather than a premature stop.</p>
<p>Two further checks strengthened confidence that nothing dangerous had been missed. When the researchers optimised the final Gaussian process surrogate itself and validated its predicted optimum in ANSYS, the resulting configuration, although geometrically distinct from the observed worst case, produced approximately 14.2 megapascals, nearly identical to the maximum found during the loop. This suggests the stress-critical condition is not an isolated spike but a neighbourhood of similarly punishing poses, exactly the kind of insight engineers need when planning real trajectories. On an independent test set of 100 previously unseen configurations, the surrogate achieved a mean absolute error of 0.13 megapascals and a coefficient of determination of 0.992, and in the top decile of the stress distribution its uncertainty estimates proved slightly conservative, with no false negatives at either the 90th or 95th percentile danger thresholds.</p>
<p>The authors are careful to frame the case study as methodological rather than as a certification of the hardware. The first link they analysed is intentionally overdesigned, so the absolute stress values remain far below the 45 megapascal yield strength of the PA12 polymer from which the link is made. The load cases considered arise from self-weight, cable preload and configuration-dependent internal load transfer, with no external payload applied at the end effector, and the analysis is quasi-static, omitting inertial effects and distributed cable friction. Within those assumptions, however, the framework demonstrates something broadly useful: it can tell designers whether substantially higher stresses are likely to remain hidden in unexplored regions of the configuration space, and it can do so with a limited simulation budget.</p>
<p>The practical implications extend beyond design verification. Because the surrogate is trained directly on robot configurations, the same workflow can be used during operation to screen trajectories, flagging or excluding poses associated with elevated structural demand before the robot ever attempts them. This stress-aware trajectory screening could be particularly valuable for hyper-redundant and snake-like robots deployed in inspection and maintenance, where the machine&#8217;s posture changes continuously and a single unlucky configuration could compromise the mission. The authors also note that the approach could be extended to multiple links, alternative structural metrics such as fatigue, or constrained multi-objective formulations, and that nonlinear material regimes would require discontinuity-aware kernels or additional regularisation.</p>
<p>What makes the work resonate beyond robotics is its demonstration of a broader principle: when every evaluation is expensive, intelligence about where to look next is worth more than raw computational power. Bayesian optimisation with Gaussian process surrogates has already transformed topology optimisation, aerospace design and co-design of robot mechanics and behaviour, and this study extends that logic into the configuration space of the robots themselves. As machines grow more articulated and their design spaces explode in size, the ability to map where danger concentrates, with a few hundred simulations instead of millions, may become as important to robot safety as the strength of any individual part.</p>
<p><strong>Subject of Research:</strong> Bayesian optimisation for identifying stress-critical robot poses in a cable-driven hyper-redundant manipulator</p>
<p><strong>Article Title:</strong> Configuration-space Bayesian optimisation for stress-critical pose identification on a hyper-redundant robot</p>
<p><strong>Article References:</strong> Poka, A., Ludovico, D., Verme, L. D. M. C. D., Manara, F., Canali, C., Berselli, G., &amp; Caldwell, D. G. (2026). Configuration-space Bayesian optimisation for stress-critical pose identification on a hyper-redundant robot. <em>International Journal of Intelligent Robotics and Applications</em>. <a href="https://doi.org/10.1007/s41315-026-00586-z" rel="noopener noreferrer">https://doi.org/10.1007/s41315-026-00586-z</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s41315-026-00586-z" rel="noopener noreferrer">10.1007/s41315-026-00586-z</a></p>
<p><strong>Keywords:</strong> Bayesian optimisation, hyper-redundant robots, Gaussian process, finite element analysis, Von Mises stress, surrogate modelling, cable-driven manipulator, robotics, structural design, worst-case stress, Expected Improvement, configuration space</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">197724</post-id>	</item>
	</channel>
</rss>
