SearcharxivSearch

arXiv subjects

Daniel Ostermeier

Publications and source records attributed to Daniel Ostermeier.

5 recordsLinked to original sources

Design and Benchmarking of the Data Distribution Service for Real-Time Interoperable Agricultural Machinery Communications

Inter-manufacturer plug-and-play communication in agricultural machinery is currently based on the ISO 11783 standard series, which specifies a 250 kbit/s CAN bus communication layer. To support higher-bandwidth use cases, the ISO~23870 series is being developed for next-generation Ethernet-based agricultural machine-to-machine communication. Modern Ethernet/IP-based architectures often make use of a middleware for discovery, data exchange, quality of service configuration, and security. This paper evaluates the Data Distribution Service (DDS) as a candidate middleware for secure, plug-and-play agricultural machinery networking. DDS-based proof-of-concept communication design is presented for a representative Task Controller (TC) and implement scenario, including implement-description topics and separate best-effort and reliable topics for runtime process data. Design was implemented in C++ using the FastDDS library and benchmarked on embedded hardware representative of agricultural machinery. Runtime throughput was evaluated for one-to-one and one-to-two TC-implement scenarios under four DDS security configurations. The results show that DDS security mechanisms substantially reduce maximum throughput on embedded hardware. In the tested best-effort scenarios, signing and encryption reduced mean throughput by approximately 70-84% compared with the unsecured configuration. Encrypted one-to-one best-effort case achieved approximately 4980 received process data updates per second on both the TC and implement, corresponding to about 50 process data updates per second per simulated section for 100 rate-controllable sections. These results indicate that DDS is a technically plausible middleware candidate for secure Ethernet-based agricultural machinery interoperability, while further work is required to evaluate latency, scalability, vendor interoperability, and lower-power devices.

cs.NI

Automatic Geometric Decomposition for Analytical Inverse Kinematics

Calculating the inverse kinematics (IK) is a fundamental challenge in robotics. Compared to numerical or learning-based approaches, analytical IK provides higher efficiency and accuracy. However, existing analytical approaches are difficult to use in most applications, as they require human ingenuity in the derivation process, are numerically unstable, or rely on time-consuming symbolic manipulation. In contrast, we propose a method that, for the first time, enables an analytical IK derivation and computation in less than a millisecond in total. Our work is based on an automatic online decomposition of the IK into pre-solved, numerically stable subproblems via a kinematic classification of the respective manipulator. In numerical experiments, we demonstrate that our approach is orders of magnitude faster in deriving the IK than existing tools that employ symbolic manipulation. Following this one-time derivation, our method matches and often surpasses baselines, such as IKFast, in terms of speed and accuracy during the computation of explicit IK solutions. Finally, we provide an open-source C++ toolbox with Python wrappers that substantially reduces the entry barrier to using analytical IK in applications like rapid prototyping and kinematic robot design.

cs.RO

Elements of a theory for multiparton interactions in QCD

We perform a detailed investigation of multiple hard interactions in hadron-hadron collisions. We discuss the space-time, spin and color structure of multiple interactions, classify different contributions according to their power behavior and provide several elements required for establishing all-order factorization. This also allows us to analyze the structure of Sudakov logarithms in double hard scattering. We show how multiparton distributions can be constrained by lattice calculations, by connecting them with generalized parton distributions, and by calculating their behavior at large transverse parton momenta.

hep-ph

Cancellation of Glauber gluon exchange in the double Drell-Yan process

An essential part of any factorisation proof is the demonstration that the exchange of Glauber gluons cancels for the considered observable. We show this cancellation at all orders for double Drell-Yan production (the double parton scattering process in which a pair of electroweak gauge bosons is produced) both for the integrated cross section and for the cross section differential in the transverse boson momenta. In the process of constructing this proof, we also revisit and clarify some issues regarding the Glauber cancellation argument and its relation to the rest of the factorisation proof for the single Drell-Yan process.

hep-ph

Progress in Double Parton Scattering Studies

An overview of theoretical and experimental progress in double parton scattering (DPS) is presented. The theoretical topics cover factorization in DPS, models for double parton distributions and DPS in charm production and nuclear collisions. On the experimental side, CMS results for dijet and double J/ψ production, in light of DPS, as well as first results for the 4-jet channel are presented. ALICE reports on a study of open charm and J/ψ multiplicity dependence.

hep-ph