Zobrazeno 1 - 10
of 6 373
pro vyhledávání: '"HOWIE, P"'
In the complete hyperbolic structure on the complement of the figure eight knot, we determine the set of lambda lengths from the maximal cusp to itself. Using the correspondence between spinors and spin-decorated horospheres, we show that these lambd
Externí odkaz:
http://arxiv.org/abs/2411.06368
Large language models (LLMs) typically improve performance by either retrieving semantically similar information, or enhancing reasoning abilities through structured prompts like chain-of-thought. While both strategies are considered crucial, it rema
Externí odkaz:
http://arxiv.org/abs/2410.11588
Graphs of Convex Sets (GCS) is a recent method for synthesizing smooth trajectories by decomposing the planning space into convex sets, forming a graph to encode the adjacency relationships within the decomposition, and then simultaneously searching
Externí odkaz:
http://arxiv.org/abs/2410.08909
Autor:
Mick, Darwin, Pool, Taylor, Nagaraju, Madankumar Sathenahally, Kaess, Michael, Choset, Howie, Travers, Matt
We introduce a LiDAR inertial odometry (LIO) framework, called LiPO, that enables direct comparisons of different iterative closest point (ICP) point cloud registration methods. The two common ICP methods we compare are point-to-point (P2P) and point
Externí odkaz:
http://arxiv.org/abs/2410.08097
Autor:
Bhat, Anoop, Gutow, Geordan, Vundurthy, Bhaskar, Ren, Zhongqiang, Rathinam, Sivakumar, Choset, Howie
The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are moving. A solution to the MT-TSP-O is a trajectory that visits each moving
Externí odkaz:
http://arxiv.org/abs/2409.09852
Autonomous robotic search has important applications in robotics, such as the search for signs of life after a disaster. When \emph{a priori} information is available, for example in the form of a distribution, a planner can use that distribution to
Externí odkaz:
http://arxiv.org/abs/2409.09164
Multi-agent proximal policy optimization (MAPPO) has recently demonstrated state-of-the-art performance on challenging multi-agent reinforcement learning tasks. However, MAPPO still struggles with the credit assignment problem, wherein the sheer diff
Externí odkaz:
http://arxiv.org/abs/2408.04295
This paper investigates a constrained inverse kinematic (IK) problem that seeks a feasible configuration of an articulated robot under various constraints such as joint limits and obstacle collision avoidance. Due to the high-dimensionality and compl
Externí odkaz:
http://arxiv.org/abs/2406.11572
Autor:
Howie, James
A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in the case $(
Externí odkaz:
http://arxiv.org/abs/2405.13644
Autor:
Yin, Peng, Jiao, Jianhao, Zhao, Shiqi, Xu, Lingyun, Huang, Guoquan, Choset, Howie, Scherer, Sebastian, Han, Jianda
In the realm of robotics, the quest for achieving real-world autonomy, capable of executing large-scale and long-term operations, has positioned place recognition (PR) as a cornerstone technology. Despite the PR community's remarkable strides over th
Externí odkaz:
http://arxiv.org/abs/2405.04812